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žené v:

Podrobná bibliografia
Vydané v:	Discrete Applied Mathematics Ročník 136; číslo 2; s. 329 - 340
Hlavní autori:	Shamir, Ron, Sharan, Roded
Médium:	Journal Article Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	Lausanne Elsevier B.V 15.02.2004 Amsterdam Elsevier New York, NY
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!