3008 search results - page 14 / 602 » Independence in connected graphs |
120
click to vote
GG
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Hierarchical graph transformation as defined in [1, 2] extends double-pushout graph transformation in the spirit of term rewriting: Graphs are provided with hierarchical...
189
Voted
WG
2004
Springer
15 years 9 months ago
2004
Springer
A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight independent set problem i...
122
click to vote
ESA
2006
Springer
15 years 7 months ago
2006
Springer
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
134
click to vote
FSTTCS
2010
Springer
15 years 2 months ago
2010
Springer
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...
ENDM
2008
15 years 4 months ago
2008
