On external-memory planar depth first search.
Arge, Lars, Meyer, Ulrich, Toma, Laura, Zeh, Norbert (2003)
Journal of Graph Algorithms and Applications
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “The absence of efficient dual pairs of spanning trees in planar graphs.”
On external-memory planar depth first search.
Relaxed graceful labellings of trees.
Van Bussel, Frank (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the cutting edge: simplified planarity by edge addition.
Boyer, John M., Myrvold, Wendy J. (2004)
Journal of Graph Algorithms and Applications
Similarity:
On vertices and edges in maximum path-factors of a tree
Zdzisław Skupień, Władysław Zygmunt (1980)
Fundamenta Mathematicae
Similarity:
Planar maps as labeled mobiles.
Bouttier, J., Di Francesco, P., Guitter, E. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the Vertex Separation of Maximal Outerplanar Graphs
Markov, Minko (2008)
Serdica Journal of Computing
Similarity:
We investigate the NP-complete problem Vertex Separation (VS) on Maximal Outerplanar Graphs (mops). We formulate and prove a “main theorem for mops”, a necessary and sufficient condition for the vertex separation of a mop being k. The main theorem reduces the vertex separation of mops to a special kind of stretchability, one that we call affixability, of submops.
Tree-thickness and caterpillar-thickness under girth constraints.
Liu, Qi, West, Douglas B. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Generalized Cauchy identities, trees and multidimensional Brownian motions. I: Bijective proof of generalized Cauchy identities.
Śniady, Piotr (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Edge shift distance between trees
Bohdan Zelinka (1992)
Archivum Mathematicum
Similarity:
Edge shift distance between isomorphism classes of graphs, introduced by M. Johnson, is investigated in the case of trees and compared with other distances.