WG
2009
Springer
14 years 6 months ago
2009
Springer
We study the parameterized complexity of several minimum label graph problems, in which we are given an undirected graph whose edges are labeled, and a property Π, and we are ask...
WG
2009
Springer
14 years 6 months ago
2009
Springer
In this paper, we study the sub-coloring and hypo-coloring problems on interval graphs. These problems have applications in job scheduling and distributed computing and can be used...
WG
2009
Springer
14 years 6 months ago
2009
Springer
We present a fully dynamic algorithm that maintains three different representations of an interval graph: a minimal interval model of the graph, the PQ-tree of its maximal cliques...
WG
2009
Springer
14 years 6 months ago
2009
Springer
WG
2009
Springer
14 years 6 months ago
2009
Springer
The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices of G. This problem is a classic NP-complete problem. So far, finding an exact al...
WG
2009
Springer
14 years 6 months ago
2009
Springer
WG
2009
Springer
14 years 6 months ago
2009
Springer
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our...
WG
2009
Springer
14 years 6 months ago
2009
Springer