WG
13 years 11 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...
WG
13 years 11 months ago
2004 Springer
In this paper, we consider the recognition problem on two classes of perfectly orderable graphs, namely, the HHD-free and the Welsh-Powell opposition graphs (or WPO-graphs). In par...
WG
13 years 11 months ago
2004 Springer WG
13 years 11 months ago
2004 Springer 
The clique problem consists in determining whether an undirected graph G of order n contains a clique of order . In this paper we are concerned with the decremental version of cliq...
WG
13 years 11 months 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
|
Theoretical Computer Science