A Linear Recognition Algorithm for Cographs
From MaRDI portal
Publication:3694709
Recommendations
Cited in
(only showing first 100 items - show all)- Asymptotic enumeration of cographs
- Complexity and parameterized algorithms for cograph editing
- On semi-\(P_ 4\)-sparse graphs
- Restrictions of graph partition problems. I
- On the computational difficulty of the terminal connection problem
- The \(\langle t \rangle \)-property of some classes of graphs
- On parallel recognition of cographs
- Laplacian spectrum of weakly quasi-threshold graphs
- A fully dynamic algorithm for modular decomposition and recognition of cographs.
- The graph sandwich problem for \(P_4\)-sparse graphs
- A characterization of claw-free \(b\)-perfect graphs
- Parallel recognition of complement reducible graphs and cotree construction
- Augmenting graphs for independent sets
- Exclusive graph searching vs. pathwidth
- Characterisations and Linear-Time Recognition of Probe Cographs
- Dynamic Distance Hereditary Graphs Using Split Decomposition
- Structure and stability number of chair-, co-P- and gem-free graphs revisited
- Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
- Edge search number of cographs
- Linear-time algorithm for the matched-domination problem in cographs
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
- Laminar structure of ptolemaic graphs with applications
- On switching classes, NLC-width, cliquewidth and treewidth
- On the structure of bull-free perfect graphs
- On graphs without a \(C_{4}\) or a diamond
- Vertex partitions of graphs into cographs and stars
- On the spectrum of threshold graphs
- An improvement on the complexity of factoring read-once Boolean functions
- On cocolourings and cochromatic numbers of graphs
- Computing residual connectedness reliability for restricted networks
- A fully dynamic algorithm for the recognition of \(P_4\)-sparse graphs
- Dynamically maintaining split graphs
- Linear time optimization algorithms for \(P_ 4\)-sparse graphs
- Characterizations for restricted graphs of NLC-width 2
- Vertex disjoint paths on clique-width bounded graphs
- Minimal separators in \(P_4\)-sparse graphs
- Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs
- A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs
- Maximum Weight Independent Sets in ( $$S_{1,1,3}$$ , bull)-free Graphs
- On tree representations of relations and graphs: symbolic ultrametrics and cograph edge decompositions
- On the relationship between NLC-width and linear NLC-width
- A simple linear-time recognition algorithm for weakly quasi-threshold graphs
- Path-bicolorable graphs
- Eigenvalue location in cographs
- Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time.
- The behavior of clique-width under graph operations and graph transformations
- Partition refinement techniques: an interesting algorithmic tool kit
- NLC\(_{2}\)-decomposition in polynomial time
- Graphs of Linear Clique-Width at Most 3
- Completely separable graphs
- A linear-time recognition algorithm for \(P_{4}\)-reducible graphs
- A new mapping between combinatorial proofs and sequent calculus proofs read out from logical flow graphs
- Characterizing and Computing Minimal Cograph Completions
- Triangulating multitolerance graphs
- \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
- Efficient recognition algorithms for boundary and linear eNCE graph languages
- Enumerative aspects of certain subclasses of perfect graphs
- Edge Search Number of Cographs in Linear Time
- Strong tree-cographs are Birkhoff graphs
- scientific article; zbMATH DE number 2230325 (Why is no real title available?)
- scientific article; zbMATH DE number 3920497 (Why is no real title available?)
- New results on independent sets in extensions of \(2K_2\)-free graphs
- Fixed-parameter algorithms for the cocoloring problem
- Partitioning cographs into cliques and stable sets
- On symbolic ultrametrics, cotree representations, and cograph edge decompositions and partitions
- Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes
- Efficient parallel recognition of cographs
- Secure domination in cographs
- scientific article; zbMATH DE number 6963897 (Why is no real title available?)
- Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width
- Characterizations of cographs as intersection graphs of paths on a grid
- Weighted connected domination and Steiner trees in distance-hereditary graphs
- A fast parallel algorithm to recognize partitionable graphs
- Partitioning a graph into complementary subgraphs
- Induced subgraph isomorphism: are some patterns substantially easier than others?
- On the double Roman domination of graphs
- On the terminal connection problem
- The neighborhood polynomial of chordal graphs
- Maker-Breaker domination game
- Choosability of P 5-Free Graphs
- A theorem on permutation graphs with applications
- Miscellaneous digraph classes
- Distance eigenvalues of a cograph and their multiplicities
- A new approach for the domination problem on permutation graphs
- On perfect switching classes
- Parameterized complexity of independent set in H-free graphs
- On bipartite graphs with weak density of some subgraphs
- Bounded search tree algorithms for parametrized cograph deletion: efficient branching rules by exploiting structures of special graph classes
- Bipartite-perfect graphs
- On retracts, absolute retracts, and foldings in cographs
- Characterizing and computing minimal cograph completions
- LINEAR TIME RECOGNITION AND OPTIMIZATIONS FOR WEAK-BISPLIT GRAPHS, BI-COGRAPHS AND BIPARTITE P6-FREE GRAPHS
- Recognition and isomorphism of tree-like \(P_4\)-connected graphs
- The secure domination problem in cographs
- Edge-colouring of regular graphs of large degree
- On some graphs with a unique perfect matching
- Scattering number and modular decomposition
- Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs
- A multivariate analysis of the strict terminal connection problem
- Recognition of probe proper interval graphs
This page was built for publication: A Linear Recognition Algorithm for Cographs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3694709)
