Worst-case relative performances of heuristics for the Steiner problem in graphs.
Three new heuristics for the Steiner problem in graphs.
On the computational complexity of centers locating in a graph
It is shown that the problem of finding a minimum -basis, the -center problem, and the -median problem are -complete even in the case of such communication networks as planar graphs with maximum degree 3. Moreover, a near optimal -center problem is also -complete.
Diametrically critical tournaments
Remarks on regular factors of regular graphs
Connectivity of Regular Graphs and the Existence of 1-Factors
A Simple Proof of the Perfect Matching Theorem
Two heuristics for the absolute -center problem in graphs
On the interchange heuristic for locating centers and medians in a graph
On minimal graphs of diameter with every edge in a -cycle
A bound for the Steiner tree problem in graphs
Complexity of decomposing graphs into factors with given diameters or radii
Two constructions of geodetic graphs
Coloring of graphs by partitioning
A note on constructing large Cayley graphs of given degree and diameter by voltage assignments.
On equality of edge-connectivity and minimum degree of a graph
On the Existence of Certain Graphs with Diameter Two
Profesor Anton Huťa sedemdesiatročný
On Irreducible Graphs of Diameter Two without Triangles
On the Extension of Graphs with a Given Diameter without Superfluous Edges
Page 1 Next