The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
B. Courcelle (1992)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “A parametric analysis of the largest induced tree problem in random graphs”
The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
On the Horton-Strahler number for random tries
L. Devroye, P. Kruszewski (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On the size of a maximal induced tree in a random graph
Michał Karoński, Zbigniew Palka (1980)
Mathematica Slovaca
Similarity:
Skip trees, an alternative data structure to skip lists in a concurrent approach
Xavier Messeguer (1997)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Isolated trees in a bichromatic random graph
Zbigniew Pałka (1982)
Colloquium Mathematicae
Similarity:
On the average number of registers needed to evaluate a special class of backtrack trees
U. Trier (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Forest decompositions of graphs with cyclomatic number 2.
Farrell, E.J. (1983)
International Journal of Mathematics and Mathematical Sciences
Similarity: