686 search results - page 7 / 138 » Packing Cycles in Graphs |
CORR
2006
Springer
14 years 9 months ago
2006
Springer
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 ...
CSR
2007
Springer
14 years 9 months ago
2007
Springer
90
Voted
SIAMJO
2008
14 years 9 months ago
2008
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
ASPDAC
2005
ACM
14 years 11 months ago
2005
ACM
Abstract— ACG (Adjacent Constraint Graph) is a general floorplan representation. The refinement of constraint graphs gives not only an efficient representation but also a repre...
CCCG
2006
14 years 10 months ago
2006
We study the Hamiltonian Cycle problem in graphs induced by subsets of the vertices of the tiling of the plane with equilateral triangles. By analogy with grid graphs we call such...