Sciweavers

7 search results - page 1 / 2
» Recognizing d-Interval Graphs and d-Track Interval Graphs
Sort
View
FAW
2010
Springer
232views Algorithms» more  FAW 2010»
13 years 10 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
ALGORITHMICA
2010
137views more  ALGORITHMICA 2010»
13 years 9 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
SODA
2003
ACM
120views Algorithms» more  SODA 2003»
13 years 10 months ago
Certifying algorithms for recognizing interval graphs and permutation graphs
Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, ...
DAM
2007
105views more  DAM 2007»
13 years 9 months ago
Recognizing and representing proper interval graphs in parallel using merging and sorting
We present a parallel algorithm for recognizing and representing a proper interval graph in O(log2 n) time with O(m + n) processors on the CREW PRAM, where m and n are the number ...
Jørgen Bang-Jensen, Jing Huang, Louis Ibarr...