Sciweavers

553 search results - page 19 / 111
» Cover Contact Graphs
Sort
View
ICALP
2005
Springer
15 years 3 months ago
Optimal Cover Time for a Graph-Based Coupon Collector Process
Nedialko B. Dimitrov, C. Greg Plaxton
73
Voted
ISAAC
2004
Springer
96views Algorithms» more  ISAAC 2004»
15 years 3 months ago
Many-to-many Disjoint Path Covers in a Graph with Faulty Elements
Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim
WG
1994
Springer
15 years 2 months ago
Complexity of Graph Covering Problems
Jan Kratochvíl, Andrzej Proskurowski, Jan A...
76
Voted
CPC
2008
114views more  CPC 2008»
14 years 10 months ago
Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
In 1998 Luczak, R
Peter Allen