94 search results - page 13 / 19 » Packing d-degenerate graphs |
ISAAC
2005
Springer
14 years 27 days ago
2005
Springer
Let G be a graph with a nonnegative integral function w defined on V (G). A collection F of subsets of V (G) (repetition is allowed) is called a feedback vertex set packing in G ...
HEURISTICS
2002
13 years 7 months ago
2002
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
PSB
2004
13 years 8 months ago
2004
Association studies in populations relate genomic variation among individuals with medical condition. Key to these studies is the development of efficient and affordable genotypin...
IWPEC
2004
Springer
14 years 23 days ago
2004
Springer
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...
DATE
2002
IEEE
14 years 11 days ago
2002
IEEE
In this paper, we deal with arbitrary convex and concave rectilinear module packing using the Transitive Closure Graph (TCG) representation. The geometric meanings of modules are ...