327 search results - page 3 / 66 » A fully dynamic algorithm for planar |
DAM
2006
13 years 5 months ago
2006
This paper presents an optimal fully dynamic recognition algorithm for directed cographs. Given the modular decomposition tree of a directed cograph G, the algorithm supports arc ...
ALGORITHMICA
2010
13 years 5 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 ...
TALG
2008
13 years 5 months ago
2008
We present the rst dynamic algorithm that maintains a clique tree representation of a chordal graph and supports the following operations: (1) query whether deleting or inserting ...
ESA
1995
Springer
13 years 9 months ago
1995
Springer
TPDS
1998
13 years 5 months ago
1998
—Unicast_V is a progressive, misrouting algorithm for packet or virtual cut-through networks. A progressive protocol forwards a message at an intermediate node if a nonfaulty pro...