A fully dynamic algorithm for modular decomposition and recognition of cographs

The problem of dynamically recognizing a graph property calls for efficiently deciding if an input graph satisfies the property under repeated modifications to its set of vertices and edges. The input to the problem consists of a series of modifications to be performed on the graph. The objective is...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Discrete Applied Mathematics Ročník 136; číslo 2; s. 329 - 340
Hlavní autoři: Shamir, Ron, Sharan, Roded
Médium: Journal Article Konferenční příspěvek
Jazyk:angličtina
Vydáno: Lausanne Elsevier B.V 15.02.2004
Amsterdam Elsevier
New York, NY
Témata:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Cograph
Combinatorics
Combinatorics. Ordered structures
Computer science; control theory; systems
Exact sciences and technology
Fully dynamic algorithm
Graph theory
Mathematics
Modular decomposition
Recognition
Sciences and techniques of general use
Theoretical computing
Modular decomposition
Fully dynamic algorithm
Cograph
Recognition
Graph decomposition
Tree(graph)
Computer theory
Decomposition method
Edge set
Optimization
ISSN:0166-218X, 1872-6771
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The problem of dynamically recognizing a graph property calls for efficiently deciding if an input graph satisfies the property under repeated modifications to its set of vertices and edges. The input to the problem consists of a series of modifications to be performed on the graph. The objective is to maintain a representation of the graph as long as the property holds, and to detect when it ceases to hold. In this paper, we solve the dynamic recognition problem for the class of cographs and some of its subclasses. Our approach is based on maintaining the modular decomposition tree of the dynamic graph, and using this tree for the recognition. We give the first fully dynamic algorithm for maintaining the modular decomposition tree of a cograph. We thereby obtain fully dynamic algorithms for the recognition of cographs, threshold graphs, and trivially perfect graphs. All these algorithms work in constant time per edge modification and O( d) time per d-degree vertex modification.
ISSN:0166-218X
1872-6771
DOI:10.1016/S0166-218X(03)00448-7