43 search results - page 3 / 9 » Fully dynamic algorithms for chordal graphs and split graphs |
WG
2005
Springer
13 years 11 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...
ISAAC
2007
Springer
14 years 12 days ago
2007
Springer
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...
ENDM
2006
13 years 6 months ago
2006
ESA
1995
Springer
13 years 9 months ago
1995
Springer
COCOON
2005
Springer
13 years 11 months ago
2005
Springer
To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in gr...