A simple linear time LexBFS cograph recognition algorithm.
From MaRDI portal
Recommendations
Cited in
(22)- Algorithmic aspects of a general modular decomposition theory
- Laminar structure of ptolemaic graphs with applications
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
- A simple linear time algorithm for cograph recognition
- A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
- Characterizations, probe and sandwich problems on \(( k , \ell )\)-cographs
- Applying modular decomposition to parameterized cluster editing problems
- Tree decomposition and discrete optimization problems: a survey
- Fully dynamic recognition algorithm and certificate for directed cographs
- Efficient parallel recognition of cographs
- On the complexity of probe and sandwich problems for generalized threshold graphs
- Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs
- A new LBFS-based algorithm for cocomparability graph recognition
- Characterizing and Computing Minimal Cograph Completions
- A Simple Linear Time LexBFS Cograph Recognition Algorithm
- A survey of the algorithmic aspects of modular decomposition
- Orthology relation and gene tree correction: complexity results
- Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques
- Minimal separators in \(P_4\)-sparse graphs
- An improvement on the complexity of factoring read-once Boolean functions
- A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements
- Characterizing and computing minimal cograph completions
This page was built for publication: A simple linear time LexBFS cograph recognition algorithm.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5902515)
