A Simple Linear Time LexBFS Cograph Recognition Algorithm
From MaRDI portal
(Redirected from Publication:3648499)
Recommendations
- A simple linear time LexBFS cograph recognition algorithm.
- A simple linear time algorithm for cograph recognition
- scientific article; zbMATH DE number 3896983
- A Linear Recognition Algorithm for Cographs
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
Cited in
(30)- Recognizing LBFS trees of bipartite graphs
- A Linear Recognition Algorithm for Cographs
- Cograph editing: Merging modules is equivalent to editing P₄s
- A general label search to investigate classical graph search algorithms
- Recognition of chordal graphs and cographs which are cover-incomparability graphs
- 2-polarity and algorithmic aspects of polarity variants on cograph superclasses
- Weighted efficient domination for some classes of H-free and of (H₁, H₂)-free graphs
- Similarity-first search: a new algorithm with application to Robinsonian matrix recognition
- Dominating induced matchings for \(P_7\)-free graphs in linear time
- Characterizations of cographs as intersection graphs of paths on a grid
- Linearizing partial search orders
- Graphon convergence of random cographs
- A survey of the algorithmic aspects of modular decomposition
- Defining and identifying cograph communities in complex networks
- Reciprocal best match graphs
- Parameterized complexity of diameter
- A new LBFS-based algorithm for cocomparability graph recognition
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats
- The structural complexity landscape of finding balance-fair shortest paths
- A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements
- A linear algorithm for obtaining the Laplacian eigenvalues of a cograph
- Linear-sized independent sets in random cographs and increasing subsequences in separable permutations
- The partial search order problem
- A simple linear time algorithm for cograph recognition
- A simple linear time LexBFS cograph recognition algorithm.
- A simple linear-time recognition algorithm for weakly quasi-threshold graphs
- Miscellaneous digraph classes
- Random cographs: Brownian graphon limit and asymptotic degree distribution
- Groups, Graphs, and Hypergraphs: Average Sizes of Kernels of Generic Matrices with Support Constraints
- Linear time LexDFS on cocomparability graphs
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 Q3648499)
