scientific article; zbMATH DE number 512914
From MaRDI portal
Publication:4281626
Recommendations
Cited in
(22)- A linear time recognition algorithm for proper interval graphs
- Satisfiability problems on intervals and unit intervals
- Fully dynamic representations of interval graphs
- Quasi-threshold graphs
- A type of algebraic structure related to sets of intervals
- Chronological rectangle digraphs which are two-terminal series-parallel
- Characterizing interval graphs which are probe unit interval graphs
- A matrix characterization of interval and proper interval graphs
- Strictly interval graphs: characterization and linear time recognition
- A polynomial algorithm for the k-cluster problem on the interval graphs
- A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs
- 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 176590 (Why is no real title available?)
- Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs
- The Perfect Matching Reconfiguration Problem
- An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs
- On-line recognition of interval graphs in O(m+n n) time
- Simple linear time recognition of unit interval graphs
- Simpler and unified recognition algorithm for path graphs and directed path graphs
- Algorithms and complexity for monitoring edge-geodetic sets in graphs
- Chronological orderings of interval graphs
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 Q4281626)
