54 search results - page 2 / 11 » A Fully Dynamic Graph Algorithm for Recognizing Interval Gra... |
TALG
2008
13 years 4 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 ...
WG
2005
Springer
13 years 10 months ago
2005
Springer
This paper considers the problem of maintaining a compact representation (O(n) space) of permutation graphs under vertex and edge modifications (insertion or deletion). That repr...
ESA
1995
Springer
13 years 8 months ago
1995
Springer
ALGORITHMICA
1998
13 years 4 months ago
1998
In this paper we give a fully dynamic approximation scheme for maintaining all-pairs shortest paths in planar networks. Given an error parameter ε such that 0 < ε, our algorit...
EOR
2008
13 years 4 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...