Three new heuristics for the Steiner problem in graphs.
Diané, M., Plesník, Ján (1991)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Displaying similar documents to “A bound for the Steiner tree problem in graphs”
Three new heuristics for the Steiner problem in graphs.
Worst-case relative performances of heuristics for the Steiner problem in graphs.
Plesník, Ján (1991)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
A Bicriterion Steiner Tree Problem on Graph
Mirko Vujošević, Milan Stanojević (2003)
The Yugoslav Journal of Operations Research
Similarity:
Quartet compatibility and the quartet graph.
Grünewald, Stefan, Humphries, Peter J., Semple, Charles (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The number of isomorphism classes of spanning trees of a graph
Bohdan Zelinka (1978)
Mathematica Slovaca
Similarity:
Determination of Large Families and Diameter of Equiseparable Trees
Zoran Stanić (2006)
Publications de l'Institut Mathématique
Similarity:
Minimum vertex ranking spanning tree problem for chordal and proper interval graphs
Dariusz Dereniowski (2009)
Discussiones Mathematicae Graph Theory
Similarity:
A vertex k-ranking of a simple graph is a coloring of its vertices with k colors in such a way that each path connecting two vertices of the same color contains a vertex with a bigger color. Consider the minimum vertex ranking spanning tree (MVRST) problem where the goal is to find a spanning tree of a given graph G which has a vertex ranking using the minimal number of colors over vertex rankings of all spanning trees of G. K. Miyata et al. proved in [NP-hardness proof and an approximation...
Bases of classes of trees closed under subdivisions
Bohdan Zelinka (1980)
Mathematica Slovaca
Similarity:
On graceful trees.
Hegde, Suresh Manjanath, Shetty, Sudhakar (2002)
Applied Mathematics E-Notes [electronic only]
Similarity: