A dynamic distributed approach to representing proper interval graphs

DOI10.1016/j.disc.2008.04.039zbMath1210.05085OpenAlexW1972785099MaRDI QIDQ1045060

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

zbMATH Keywords

distributed computingproper interval graphimplicit representationdynamic graphinformative labeling

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Unnamed Item
• Simple linear time recognition of unit interval graphs
• Labeling schemes for dynamic tree networks
• A new characterization of proper interval graphs
• Optimal greedy algorithms for indifference graphs
• Informative labeling schemes for graphs
• A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs
• Labeling Dynamic XML Trees
• Implicat Representation of Graphs
• Topics in Intersection Graph Theory
• Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
• Compact and localized distributed data structures
• Algorithms and Data Structures

This page was built for publication: A dynamic distributed approach to representing proper interval graphs