A dynamic distributed approach to representing proper interval graphs
From MaRDI portal
Recommendations
- A Fully dynamic algorithm for recognizing and representing proper interval graphs
- A certifying and dynamic algorithm for the recognition of proper circular-arc graphs
- Algorithms and Data Structures
- Fully dynamic representations of interval graphs
- A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs
Cites work
- A Fully dynamic algorithm for recognizing and representing proper interval graphs
- A new characterization of proper interval graphs
- Algorithms and Data Structures
- Compact and localized distributed data structures
- scientific article; zbMATH DE number 2038724 (Why is no real title available?)
- scientific article; zbMATH DE number 3307330 (Why is no real title available?)
- Implicat Representation of Graphs
- Informative labeling schemes for graphs
- Labeling Dynamic XML Trees
- Labeling schemes for dynamic tree networks
- Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
- Optimal greedy algorithms for indifference graphs
- Simple linear time recognition of unit interval graphs
- Topics in Intersection Graph Theory
Cited in
(4)
This page was built for publication: A dynamic distributed approach to representing proper interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1045060)