Compact implicit representation of graphs. (Extended abstract)

DOI10.1007/10692760_14MaRDI QIDQ4232786zbMATH OpenFDO

Authors Maurizio Talamo, Paola Vocca

Publication date 15 March 1999

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

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

zbMATH Keywords

data structuring problem

Mathematics Subject Classification ID

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

Recommendations

• Representing graphs implicitly using almost optimal space
• Implicat Representation of Graphs
• Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs
• scientific article; zbMATH DE number 2079399

Cited in

(10)

• Efficient computation of implicit representations of sparse graphs
• Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs
• Implicat Representation of Graphs
• scientific article; zbMATH DE number 2079399 (Why is no real title available?)
• Implicit Component-Graph: A Discussion
• Efficient local representations of graphs
• Short Labels by Traversal and Jumping
• Representing graphs implicitly using almost optimal space
• Implicit representation of relations
• Compact representation of graphs of small clique-width

This page was built for publication: Compact implicit representation of graphs. (Extended abstract)

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