54 search results - page 1 / 11 » A Fully Dynamic Graph Algorithm for Recognizing Interval Gra... |
83
Voted
ALGORITHMICA
2010
14 years 9 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 ...
101
click to vote
WG
2009
Springer
15 years 4 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...
FAW
2010
Springer
14 years 10 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...
SODA
2003
ACM
14 years 10 months ago
2003
ACM
DAM
2007
14 years 9 months ago
2007
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 ...