136 search results - page 10 / 28 » On Touching Triangle Graphs |
STOC
2002
ACM
15 years 12 months ago
2002
ACM
The Minimum Vertex Cover problem is the problem of, given a graph, finding a smallest set of vertices that touches all edges. We show that it is NP-hard to approximate this proble...
108
click to vote
IWPEC
2004
Springer
15 years 5 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...
DCC
2004
IEEE
15 years 11 months ago
2004
IEEE
We study sets of lines of AG(n, q) and PG(n, q) with the property that no three lines form a triangle. As a result the associated point-line incidence graph contains no 6-cycles a...
100
click to vote
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
—Knowing accurate positions of nodes in wireless ad-hoc and sensor networks is essential for a wide range of pervasive and mobile applications. However, errors are inevitable in ...
ARSCOM
2007
14 years 11 months ago
2007
For any simple graph H, let σ(H, n) be the minimum m so that for any realizable degree sequence π = (d1, d2, . . . , dn) with sum of degrees at least m, there exists an n-vertex...