9 search results - page 1 / 2 » Recognizing edge clique graphs among interval graphs and pro... |
78
Voted
APPML
2007
15 years 17 days ago
2007
113
Voted
ESA
2009
Springer
15 years 5 months ago
2009
Springer
The interval graph for a set of intervals on a line consists of one vertex for each interval, and an edge for each intersecting pair of intervals. A probe interval graph is a varia...
125
click to vote
WG
2009
Springer
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
ALGORITHMICA
2010
15 years 18 days 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 ...
105
Voted
DAM
2007
15 years 13 days 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 ...