On external-memory planar depth first search.
Arge, Lars, Meyer, Ulrich, Toma, Laura, Zeh, Norbert (2003)
Journal of Graph Algorithms and Applications
Similarity:
Displaying similar documents to “Minimum-area drawings of plane 3-trees.”
On external-memory planar depth first search.
Three new heuristics for the Steiner problem in graphs.
Diané, M., Plesník, Ján (1991)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Subgraph isomorphism in planar graphs and related problems.
Eppstein, David (1999)
Journal of Graph Algorithms and Applications
Similarity:
An algorithmic Friedman-Pippenger theorem on tree embeddings and applications.
Dellamonica, Domingos jun., Kohayakawa, Yoshiharu (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A bound for the Steiner tree problem in graphs
Ján Plesník (1981)
Mathematica Slovaca
Similarity:
Embedding trees into clique-bridge-clique graphs
Bohdan Zelinka (1979)
Časopis pro pěstování matematiky
Similarity:
Embedding a forest in a graph.
Goldberg, Mark K., Magdon-Ismail, Malik (2011)
The Electronic Journal of Combinatorics [electronic only]
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...