Algorithms and Data Structures

DOI10.1007/11534273zbMATH Open1161.68689OpenAlexW3010016474MaRDI QIDQ5394258FDOQ5394258

Authors

Publication date 25 October 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11534273

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• A dynamic distributed approach to representing proper interval graphs
• Representing graphs implicitly using almost optimal space
• Dynamic and multi-functional labeling schemes
• Adjacency labeling schemes and induced-universal graphs
• Labeling schemes for dynamic tree networks

Cited in

(3)

• A dynamic distributed approach to representing proper interval graphs
• Adjacency queries in dynamic sparse graphs
• A dynamic algorithm for line graph recognition

This page was built for publication: Algorithms and Data Structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5394258)