scientific article; zbMATH DE number 4049085
From MaRDI portal
Publication:3785976
Recommendations
Cited in
(18)- An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
- On-line recognition of interval graphs in \(O(m+n \log n)\) time
- Simple linear time recognition of unit interval graphs
- A linear time recognition algorithm for proper interval graphs
- Linear recognition of almost interval graphs
- Computing the clique-separator graph for an interval graph in linear time
- scientific article; zbMATH DE number 1303554 (Why is no real title available?)
- A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
- scientific article; zbMATH DE number 1186098 (Why is no real title available?)
- Strictly interval graphs: characterization and linear time recognition
- Recognition algorithm for intersection graphs of edge disjoint paths in a tree
- scientific article; zbMATH DE number 176590 (Why is no real title available?)
- Fast and simple algorithms to count the number of vertex covers in an interval graph
- A linear-time algorithm for proper interval graph recognition
- New sequential and parallel algorithms for interval graph recognition
- A polynomial time recognition algorithm for probe interval graphs
- On finding Tucker submatrices and Lekkerkerker-Boland subgraphs
- A Polynomial Time Algorithm for Finding Linear Interval Graph Patterns
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 Q3785976)
