Dynamic Distance Hereditary Graphs Using Split Decomposition
type: Item
instance of: scholarly article
title: Dynamic Distance Hereditary Graphs Using Split Decomposition
zbMATH Open document ID: 1193.68191
DOI: 10.1007/978-3-540-77120-3_6
author: Emeric Gioan
author: Christophe Paul
published in: Algorithms and Computation
publication date: 2008-05-27T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 5279437
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-540-77120-3 6
OpenAlex ID: W1520885470
cites work: Distance-hereditary graphs
cites work: On-Line Planarity Testing
cites work: Q4508369
cites work: A Linear Recognition Algorithm for Cographs
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Decomposition of Directed Graphs
cites work: Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition
cites work: A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs
cites work: Separator based sparsification for dynamic planar graph algorithms
cites work: Graph Drawing
cites work: Transitiv orientierbare Graphen
cites work: Completely separable graphs
cites work: A Fully dynamic algorithm for recognizing and representing proper interval graphs
cites work: Q4808624
cites work: Q4252412
cites work: Topics in Intersection Graph Theory
cites work: Rank-width and vertex-minors
cites work: A fully dynamic algorithm for modular decomposition and recognition of cographs.
cites work: Recognition of Circle Graphs
description: scientific article; zbMATH DE number 5279437