A dynamic distributed approach to representing proper interval graphs
From MaRDI portal
Publication:1045060
DOI10.1016/J.DISC.2008.04.039zbMATH Open1210.05085OpenAlexW1972785099MaRDI QIDQ1045060FDOQ1045060
Authors: J. Blot 
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.04.039
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
- Topics in Intersection Graph Theory
- Optimal greedy algorithms for indifference graphs
- Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
- Title not available (Why is that?)
- Simple linear time recognition of unit interval graphs
- Implicat Representation of Graphs
- Informative labeling schemes for graphs
- Title not available (Why is that?)
- Labeling schemes for dynamic tree networks
- A Fully dynamic algorithm for recognizing and representing proper interval graphs
- A new characterization of proper interval graphs
- Algorithms and Data Structures
- Labeling Dynamic XML Trees
- Compact and localized distributed data structures
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)
