Sciweavers

202 search results - page 4 / 41
» Cycle Cover with Short Cycles
Sort
View
82
Voted
STACS
2009
Springer
15 years 6 months ago
Computing Graph Roots Without Short Cycles
Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngo...
82
Voted
ESA
2003
Springer
93views Algorithms» more  ESA 2003»
15 years 4 months ago
Finding Short Integral Cycle Bases for Cyclic Timetabling
Christian Liebchen
DM
2006
55views more  DM 2006»
14 years 11 months ago
A note on short cycles in a hypercube
Maria Axenovich, Ryan Martin
90
Voted
CPC
2010
88views more  CPC 2010»
14 years 9 months ago
Directed Graphs Without Short Cycles
Jacob Fox, Peter Keevash, Benny Sudakov
108
Voted
WG
2007
Springer
15 years 5 months ago
Minimum-Weight Cycle Covers and Their Approximability
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
Bodo Manthey