Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications
From MaRDI portal
Cites work
- A Characterization of Comparability Graphs and of Interval Graphs
- A Unified View of Graph Searching
- A linear-time algorithm for maximum-cardinality matching on cocomparability graphs
- A new LBFS-based algorithm for cocomparability graph recognition
- A simple polynomial algorithm for the longest path problem on cocomparability graphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- Corrigendum to: ``LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs
- Domination on Cocomparability Graphs
- LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
- Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
- Maximal antichains in a partially ordered set
- Maximal chordal subgraphs
- Modular decomposition and transitive orientation
- On the power of graph searching for cocomparability graphs
- Primes, irreducibles and extremal lattices
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
- Representation of a finite graph by a set of intervals on the real line
- Revisiting decomposition by clique separators
- Scheduling Interval-Ordered Tasks
- The LBFS structure and recognition of interval graphs
- The jump number and the lattice of maximal antichains
- Triangulating graphs without asteroidal triples
This page was built for publication: Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6493757)
