Efficient parallel and linear time sequential split decomposition (extended abstract)

DOI10.1007/3-540-58715-2_123MaRDI QIDQ4470503zbMATH OpenFDO

Authors Elias Dahlhaus

Publication date 1 July 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-58715-2_123

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Cited in

(8)

• Treelike comparability graphs
• Simplicial powers of graphs
• Distance labeling scheme and split decomposition
• Distance-hereditary comparability graphs
• Distance-hereditary comparability graphs
• Simplicial Powers of Graphs
• Local equivalence classes of distance-hereditary graphs using split decompositions
• A temperature fluctuation equation model dedicated to the computation of turbulent thermal layers in high Reynolds internal flows

This page was built for publication: Efficient parallel and linear time sequential split decomposition (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4470503)