803 search results - page 5 / 161 » Independence in Direct-Product Graphs |
GG
2004
Springer
15 years 5 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...
140
click to vote
WG
2004
Springer
15 years 5 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...
FSTTCS
2010
Springer
14 years 9 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 "...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
A class of graphs is nowhere dense if for every integer r there is a finite upper bound on the size of cliques that occur as (topological) r-minors. We observe that this tameness ...
FSTTCS
2010
Springer
14 years 9 months ago
2010
Springer