16 search results - page 1 / 4 » Certifying algorithms for recognizing interval graphs and pe... |
SODA
2003
ACM
13 years 10 months ago
2003
ACM
FAW
2010
Springer
13 years 9 months ago
2010
Springer
A d-interval is the union of d disjoint intervals on the real line. A d-track interval is the union of d disjoint intervals on d disjoint parallel lines called tracks, one interval...
FAW
2007
Springer
14 years 2 months ago
2007
Springer
In this paper, we consider the recognition problem on a class of perfectly orderable graphs, namely, the HHD-free graphs, i.e., graphs that do not contain any induced subgraph iso...
WG
2009
Springer
14 years 3 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...
ALGORITHMICA
2010
13 years 8 months ago
2010
We present the first dynamic graph algorithm for recognizing interval graphs. The algorithm runs in O(n log n) worst-case time per edge deletion or edge insertion, where n is the ...