scientific article; zbMATH DE number 7651152
From MaRDI portal
Publication:5874479
DOI10.4230/LIPICS.ESA.2020.13MaRDI QIDQ5874479FDOQ5874479
Authors: Jesse Beisegel, Ekkehard Köhler, Robert Scheffler, Martin Strehler 
Publication date: 7 February 2023
Full work available at URL: https://arxiv.org/abs/2005.03523
Title of this publication is not available (Why is that?)
Recommendations
- Linear time LexDFS on cocomparability graphs
- scientific article; zbMATH DE number 2086689
- A note on lexicographic breadth first search for chordal graphs
- Linear algorithms for chordal graphs of bounded directed vertex leafage
- An optimal time algorithm for minimum linear arrangement of chord graphs
- An implicit representation of chordal comparability graphs in linear time
- An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time
- Polynomial-Time Algorithm for the Leafage of Chordal Graphs
- LexBFS-orderings and powers of chordal graphs
- A linear time algorithm to list the minimal separators of chordal graphs
Cites Work
- Graph Classes: A Survey
- Depth-First Search and Linear Graph Algorithms
- LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs
- Efficient Planarity Testing
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
- Algorithmic Aspects of Vertex Elimination on Graphs
- Recognition of Circle Graphs
- On the power of graph searching for cocomparability graphs
- The LBFS structure and recognition of interval graphs
- Title not available (Why is that?)
- Moplex orderings generated by the LexDFs algorithm
- A Unified View of Graph Searching
- Maximal label search algorithms to compute perfect and minimal elimination orderings
- Recognizing breadth-first search trees in linear time
- A tie-break model for graph search
- Linear Time LexDFS on Cocomparability Graphs.
- A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs
- Title not available (Why is that?)
- DFS tree construction: Algorithms and characterizations
Cited In (3)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874479)
