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...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete Applied Mathematics Vol. 136; no. 2; pp. 329 - 340
Main Authors:	Shamir, Ron, Sharan, Roded
Format:	Journal Article Conference Proceeding
Language:	English
Published:	Lausanne Elsevier B.V 15.02.2004 Amsterdam Elsevier New York, NY
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!