9 search results - page 1 / 2 » Recognizing edge clique graphs among interval graphs and pro... |
APPML
2007
13 years 11 months ago
2007
ESA
2009
Springer
14 years 3 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...
WG
2009
Springer
14 years 5 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...
ALGORITHMICA
2010
13 years 11 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 ...
DAM
2007
13 years 10 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 ...