Graph-Theoretic Concepts in Computer Science

From MaRDI portal
Publication:5902515

DOI10.1007/b93953zbMath1255.68108MaRDI QIDQ5902515

Anna Bretscher, Christophe Paul, Derek Gordon Corneil, Michel A. Habib

Publication date: 12 January 2010

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




Related Items (20)

Minimal separators in \(P_4\)-sparse graphsOrthology Relation and Gene Tree Correction: Complexity ResultsStructural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphsCharacterizations, probe and sandwich problems on \(( k , \ell )\)-cographsCharacterizing and Computing Minimal Cograph CompletionsCharacterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliquesA survey of the algorithmic aspects of modular decompositionAn improvement on the complexity of factoring read-once Boolean functionsTree decomposition and discrete optimization problems: a surveyA simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complementsRecognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphsA simple linear time algorithm for cograph recognitionCharacterizing and computing minimal cograph completionsApplying modular decomposition to parameterized cluster editing problemsFully dynamic recognition algorithm and certificate for directed cographsAlgorithmic aspects of a general modular decomposition theoryOn the Complexity of Probe and Sandwich Problems for Generalized Threshold GraphsLaminar structure of ptolemaic graphs with applicationsA simple 3-sweep LBFS algorithm for the recognition of unit interval graphsEfficient parallel recognition of cographs




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