6490 results in Algorithmics, Complexity, Computer Algebra, Computational Geometry
4 - Pairs of Trees
-
- Book:
- Hybrid Graph Theory and Network Analysis
- Published online:
- 20 March 2010
- Print publication:
- 02 September 1999, pp 115-140
-
- Chapter
- Export citation
3 - Basoids
-
- Book:
- Hybrid Graph Theory and Network Analysis
- Published online:
- 20 March 2010
- Print publication:
- 02 September 1999, pp 80-114
-
- Chapter
- Export citation
![](https://assets.cambridge.org/97805211/06597/cover/9780521106597.jpg)
Hybrid Graph Theory and Network Analysis
-
- Published online:
- 20 March 2010
- Print publication:
- 02 September 1999
Properties of Descartes' Construction of Triangle-Free Graphs with High Chromatic Number
-
- Journal:
- Combinatorics, Probability and Computing / Volume 8 / Issue 5 / September 1999
- Published online by Cambridge University Press:
- 01 September 1999, pp. 467-472
-
- Article
- Export citation
On a Conjecture by Eriksson Concerning Overlap in Strings
-
- Journal:
- Combinatorics, Probability and Computing / Volume 8 / Issue 5 / September 1999
- Published online by Cambridge University Press:
- 01 September 1999, pp. 429-440
-
- Article
- Export citation
On the Number of Simple Cycles in Planar Graphs
-
- Journal:
- Combinatorics, Probability and Computing / Volume 8 / Issue 5 / September 1999
- Published online by Cambridge University Press:
- 01 September 1999, pp. 397-405
-
- Article
- Export citation
The Poisson–Dirichlet Distribution and the Scale-Invariant Poisson Process
-
- Journal:
- Combinatorics, Probability and Computing / Volume 8 / Issue 5 / September 1999
- Published online by Cambridge University Press:
- 01 September 1999, pp. 407-416
-
- Article
- Export citation
A Grötzsch-Type Theorem for List Colourings with Impropriety One
-
- Journal:
- Combinatorics, Probability and Computing / Volume 8 / Issue 5 / September 1999
- Published online by Cambridge University Press:
- 01 September 1999, pp. 493-507
-
- Article
- Export citation
The Path Resistance Method for Bounding the Smallest Nontrivial Eigenvalue of a Laplacian
-
- Journal:
- Combinatorics, Probability and Computing / Volume 8 / Issue 5 / September 1999
- Published online by Cambridge University Press:
- 01 September 1999, pp. 441-460
-
- Article
- Export citation
Sparse 0−1 Matrices and Forbidden Hypergraphs
-
- Journal:
- Combinatorics, Probability and Computing / Volume 8 / Issue 5 / September 1999
- Published online by Cambridge University Press:
- 01 September 1999, pp. 417-427
-
- Article
- Export citation
On Sets with a Small Subset Sum
-
- Journal:
- Combinatorics, Probability and Computing / Volume 8 / Issue 5 / September 1999
- Published online by Cambridge University Press:
- 01 September 1999, pp. 461-466
-
- Article
- Export citation
The Minimum Size of Saturated Hypergraphs
-
- Journal:
- Combinatorics, Probability and Computing / Volume 8 / Issue 5 / September 1999
- Published online by Cambridge University Press:
- 01 September 1999, pp. 483-492
-
- Article
- Export citation
Studying Balanced Allocations with Differential Equations
-
- Journal:
- Combinatorics, Probability and Computing / Volume 8 / Issue 5 / September 1999
- Published online by Cambridge University Press:
- 01 September 1999, pp. 473-482
-
- Article
- Export citation
Total Path Length for Random Recursive Trees
-
- Journal:
- Combinatorics, Probability and Computing / Volume 8 / Issue 4 / July 1999
- Published online by Cambridge University Press:
- 01 July 1999, pp. 317-333
-
- Article
- Export citation
Rewriting on cyclic structures: Equivalence between the operational and the categorical description
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 33 / Issue 4-5 / July 1999
- Published online by Cambridge University Press:
- 15 August 2002, pp. 467-493
- Print publication:
- July 1999
-
- Article
- Export citation
On Distributive Fixed-Point Expressions
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 33 / Issue 4-5 / July 1999
- Published online by Cambridge University Press:
- 15 August 2002, pp. 427-446
- Print publication:
- July 1999
-
- Article
- Export citation
One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights
-
- Journal:
- Combinatorics, Probability and Computing / Volume 8 / Issue 4 / July 1999
- Published online by Cambridge University Press:
- 01 July 1999, pp. 347-361
-
- Article
- Export citation
A note on Coinduction and Weak Bisimilarity for While Programs
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 33 / Issue 4-5 / July 1999
- Published online by Cambridge University Press:
- 15 August 2002, pp. 393-400
- Print publication:
- July 1999
-
- Article
- Export citation
A Counterexample to Kleitman's Conjecture Concerning an Edge-Isoperimetric Problem
-
- Journal:
- Combinatorics, Probability and Computing / Volume 8 / Issue 4 / July 1999
- Published online by Cambridge University Press:
- 01 July 1999, pp. 301-305
-
- Article
- Export citation
The μ-calculus alternation-depth hierarchy is strict on binary trees
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 33 / Issue 4-5 / July 1999
- Published online by Cambridge University Press:
- 15 August 2002, pp. 329-339
- Print publication:
- July 1999
-
- Article
- Export citation