Graph-Theoretic Concepts in Computer Science

DOI10.1007/11604686zbMATH Open1171.68630MaRDI QIDQ5897575FDOQ5897575

Authors: R. M. McConnell, Fabien De Montgolfier 

Publication date: 1 November 2006

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

Recommendations

• Tree-representation of set families and applications to combinatorial decompositions
• A generic approach to decomposition algorithms, with an application to digraph decomposition
• \(P_ 4\)-trees and substitution decomposition
• A Representation Theorem for Union-Difference Families and Application
• A survey of the algorithmic aspects of modular decomposition

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Cited In (5)

• Tree-representation of set families and applications to combinatorial decompositions
• A generic approach to decomposition algorithms, with an application to digraph decomposition
• A type of algebraic structure related to sets of intervals
• Fully dynamic representations of interval graphs
• A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs

This page was built for publication: Graph-Theoretic Concepts in Computer Science

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