3 search results - page 1 / 1 » Packing Edge Disjoint Triangles: A Parameterized View |
IWPEC
2004
Springer
13 years 10 months 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...
SIAMDM
2008
13 years 4 months ago
2008
A set of pairwise edge-disjoint triangles of an edge-colored Kn is r-color avoiding if it does not contain r monochromatic triangles, each having a different color. Let fr(n) be th...
ISVD
2007
IEEE
13 years 10 months ago
2007
IEEE
Voronoi diagram for a set of geometric objects is a partition of the plane (or space in higher dimensions) into disjoint regions each dominated by some given object under a predet...