Sciweavers

Share
17 search results - page 1 / 4
» Certifying algorithms for recognizing interval graphs and pe...
Sort
View
SODA
2003
ACM
120views Algorithms» more  SODA 2003»
9 years 2 months ago
Certifying algorithms for recognizing interval graphs and permutation graphs
Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, ...
FAW
2010
Springer
232views Algorithms» more  FAW 2010»
9 years 2 months ago
Recognizing d-Interval Graphs and d-Track Interval Graphs
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...
Minghui Jiang
FAW
2007
Springer
115views Algorithms» more  FAW 2007»
9 years 7 months ago
An O ( nm )-Time Certifying Algorithm for Recognizing HHD-Free Graphs
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...
Stavros D. Nikolopoulos, Leonidas Palios
WG
2009
Springer
9 years 8 months ago
A New Intersection Model and Improved Algorithms for Tolerance Graphs
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in con´Čéict. This class of graphs, which generalizes...
George B. Mertzios, Ignasi Sau, Shmuel Zaks
ALGORITHMICA
2010
137views more  ALGORITHMICA 2010»
9 years 1 months ago
A Fully Dynamic Graph Algorithm for Recognizing Interval Graphs
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 ...
Louis Ibarra
books