Searching for authors named "Colin Cooper" – sorted by Relevance.
-
The Cores of Random Hypergraphs with a Given Degree Sequence
- The cores of random hypergraphs with a given degree sequence. Colin Cooper y August 30, 2003
- Cited by 12 (2 self) – Add To MetaCart
-
\Lambda Alan Frieze
- sequence Colin Cooper \Lambda Alan Frieze y April 6, 2002 Abstract We give results on the strong
- Add To MetaCart
-
Multi-coloured Hamilton cycles in random edge-coloured graphs
- Multi-coloured Hamilton cycles in random edge-coloured graphs Colin Cooper* Alan Frieze i June 11
- Add To MetaCart
-
A General Model of Undirected Web Graphs
- A general model of undirected web graphs Colin Cooper 1 and Alan M. Frieze 2 1 School
- Cited by 14 (4 self) – Add To MetaCart
-
The
- The cover time of the giant component of a random graph Colin Cooper ∗ Alan Frieze † July 23, 2008
- Add To MetaCart
-
unknown title
- the Cockayne-Goodman-Hedetniemi algorithm ∗ Colin Cooper 1 Michele Zito 2 1 Department of Computer Science
- Add To MetaCart
-
The cover time of the preferential attachment graph
- The cover time of the preferential attachment graph Colin Cooper ∗ Alan Frieze † September 26
- Cited by 7 (5 self) – Add To MetaCart
-
The Cover Time of Random Regular Graphs
- The cover time of random regular graphs Colin Cooper Alan Frieze y June 2, 2003 Abstract Let r
- Cited by 6 (5 self) – Add To MetaCart
-
The Size of the Largest Strongly Connected Component of a Random Digraph With a Given Degree Sequence
- sequence Colin Cooper Alan Frieze y April 6, 2002 Abstract We give results on the strong connectivity
- Cited by 11 (7 self) – Add To MetaCart
-
The cover time of random digraphs
- The cover time of random digraphs Colin Cooper ∗ Alan Frieze † February 12, 2008 d log n n
- Cited by 1 (1 self) – Add To MetaCart

