scientific article; zbMATH DE number 1303554
From MaRDI portal
Publication:4250178
Recommendations
- A fully dynamic graph algorithm for recognizing interval graphs
- A linear-time algorithm for proper interval graph recognition
- A Fully dynamic algorithm for recognizing and representing proper interval graphs
- New sequential and parallel algorithms for interval graph recognition
- An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
- A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs
- scientific article; zbMATH DE number 4049085
- A linear time recognition algorithm for proper interval graphs
- scientific article; zbMATH DE number 176590
- scientific article; zbMATH DE number 6810347
Cited in
(38)- The clique-separator graph for chordal graphs
- Weighted sum coloring in batch scheduling of conflicting jobs
- A new characterization of proper interval graphs
- Fully dynamic representations of interval graphs
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
- A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
- Integral mixed unit interval graphs
- A fully dynamic graph algorithm for recognizing interval graphs
- New results on induced matchings
- Can transitive orientation make sandwich problems easier?
- Recognizing d-interval graphs and d-track interval graphs
- Characterizing interval graphs which are probe unit interval graphs
- A matrix characterization of interval and proper interval graphs
- Fast algorithms for identifying maximal common connected sets of interval graphs
- Unit interval graphs: a story with open ends
- Separation dimension of graphs and hypergraphs
- The LBFS structure and recognition of interval graphs
- A polynomial algorithm for the k-cluster problem on the interval graphs
- Approximate L(δ1,δ2,…,δt)‐coloring of trees and interval graphs
- A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs
- A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs
- scientific article; zbMATH DE number 1522927 (Why is no real title available?)
- scientific article; zbMATH DE number 6810347 (Why is no real title available?)
- Unit interval graphs of open and closed intervals
- A structural characterization for certifying Robinsonian matrices
- Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs
- A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs
- Recognizing interval bigraphs by forbidden patterns
- A characterization of unit interval bigraphs of open and closed intervals
- An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs
- Simpler and unified recognition algorithm for path graphs and directed path graphs
- Mixed unit interval graphs
- Interval k-graphs : recognition and forbidden obstructions
- Recognizing and representing proper interval graphs in parallel using merging and sorting
- Recognizing graphs without asteroidal triples
- On end-vertices of lexicographic breadth first searches
- A simple algorithm to find Hamiltonian cycles in proper interval graphs
- On compact and efficient routing in certain graph classes
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 Q4250178)
