Graph-Theoretic Concepts in Computer Science

DOI10.1007/11604686MaRDI QIDQ5897547zbMATH OpenFDO

Authors Daniel Meister

Publication date 1 November 2006

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

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Treewidth and minimum fill-in on permutation graphs in linear time
• scientific article; zbMATH DE number 1304320
• Treewidth and Pathwidth of Permutation Graphs
• scientific article; zbMATH DE number 1262810
• Treewidth and pathwidth of permutation graphs

Cited in

(9)

• A Characterisation of the Minimal Triangulations of Permutation Graphs
• Characterizing and computing minimal cograph completions
• Treewidth and minimum fill-in on permutation graphs in linear time
• A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
• Edge search number of cographs
• Edge Search Number of Cographs in Linear Time
• Treewidth and Pathwidth of Permutation Graphs
• Treewidth and pathwidth of permutation graphs
• Mixed Search Number of Permutation Graphs

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 Q5897547)