WG
2009
Springer
14 years 6 months ago
2009
Springer
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in conflict. This class of graphs, which generalizes...
WG
2009
Springer
14 years 6 months ago
2009
Springer
WG
2009
Springer
14 years 6 months ago
2009
Springer
Chordal graphs, also called triangulated graphs, are important in algorithmic graph theory. In this paper we generalise the definition of chordal graphs to the class of directed ...
WG
2009
Springer
14 years 6 months ago
2009
Springer
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
