124
click to vote
WG
15 years 7 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...
102
click to vote
WG
15 years 7 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 ...
100
click to vote
WG
15 years 7 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
15 years 7 months ago
2009 Springer 109
Voted
WG
15 years 7 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...
|
Theoretical Computer Science