A new simple linear algorithm to recognize interval graphs
From MaRDI portal
Recommendations
Cited in
(26)- A linear time recognition algorithm for proper interval graphs
- Linear algorithm for domatic number problem on interval graphs
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
- Fully dynamic representations of interval graphs
- A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
- Weighted independent perfect domination on cocomparability graphs
- Graph searches and their end vertices
- The LBFS structure and recognition of interval graphs
- A new LBFS-based algorithm for cocomparability graph recognition
- scientific article; zbMATH DE number 4049085 (Why is no real title available?)
- An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
- scientific article; zbMATH DE number 1303554 (Why is no real title available?)
- scientific article; zbMATH DE number 512914 (Why is no real title available?)
- Maximal neighborhood search and rigid interval graphs
- The LexCycle on \(\overline{P_2\cup P_3} \)-free cocomparability graphs
- A four-sweep LBFS recognition algorithm for interval graphs
- Similarity-first search: a new algorithm with application to Robinsonian matrix recognition
- A Polynomial Time Algorithm for Finding Linear Interval Graph Patterns
- scientific article; zbMATH DE number 7651152 (Why is no real title available?)
- On-line recognition of interval graphs in O(m+n n) time
- Graphs with at most two moplexes
- Semi-proper interval graphs
- A linear-time algorithm for proper interval graph recognition
- Simple linear time recognition of unit interval graphs
- ILIGRA: an efficient inverse line graph algorithm
- On end-vertices of lexicographic breadth first searches
This page was built for publication: A new simple linear algorithm to recognize interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035766)
