234
click to vote
WG
16 years 1 days 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...
193
click to vote
WG
16 years 1 days ago
2004 Springer
We consider the NP-complete problem of deciding whether an input graph on n vertices has k vertex-disjoint copies of a fixed graph H. For H = K3
184
click to vote
WG
16 years 1 days ago
2004 Springer
Abstract. Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wish to partition G into connected components...
177
click to vote
WG
16 years 1 days ago
2004 Springer 
An undirected graph is a treelike comparability graph if it admits a transitive orientation such that its transitive reduction is a tree. We show that treelike comparability graphs...
176
click to vote
WG
16 years 1 days ago
2004 Springer 
The family of well-orderly maps is a family of planar maps with the property that every connected planar graph has at least one plane embedding which is a well-orderly map. We show...
|
Theoretical Computer Science