23 search results - page 2 / 5 » wg 2004 |
WG
2004
Springer
14 years 4 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
14 years 4 months 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...
WG
2004
Springer
14 years 4 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
WG
2004
Springer
14 years 4 months ago
2004
Springer
We show how to use split decomposition to compute the weighted clique number and the chromatic number of a graph and we apply these results to some classes of graphs. In particular...
WG
2004
Springer
14 years 4 months ago
2004
Springer
We propose a two-phase heuristic for crossing reduction in circular layouts. While the first algorithm uses a greedy policy to build a good initial layout, an adaptation of the si...