WG
2004
Springer
13 years 9 months ago
2004
Springer
WG
2004
Springer
13 years 9 months ago
2004
Springer
WG
2004
Springer
13 years 9 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
2004
Springer
13 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...
WG
2004
Springer
13 years 9 months ago
2004
Springer
Let be the following strategy to construct a walk in a labeled digraph: at each vertex, we follow the unvisited arc of minimum label. In this work we study for which languages, app...
WG
2004
Springer
13 years 9 months ago
2004
Springer
WG
2004
Springer
13 years 9 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
2004
Springer
13 years 9 months ago
2004
Springer
It has long been known that the number of spanning trees in circulant graphs with fixed jumps and n nodes satisfies a recurrence relation in n. The proof of this fact was algebra...
WG
2004
Springer
13 years 9 months 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...
WG
2004
Springer
13 years 9 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