Efficient local representations of graphs

DOI10.1007/978-3-319-31940-7_6MaRDI QIDQ5506777zbMATH OpenOpenAlexWikidataFDO

Authors Edward Scheinerman

Publication date 16 December 2016

Published in Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-31940-7_6

zbMATH Keywords

hereditary classes of graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Local representations using very short labels
• Implicat Representation of Graphs
• On the succinct representation of graphs
• scientific article; zbMATH DE number 1262796
• An efficient representation of chordal graphs

Cites work

• scientific article; zbMATH DE number 4200260 (Why is no real title available?)
• scientific article; zbMATH DE number 739017 (Why is no real title available?)
• scientific article; zbMATH DE number 2117210 (Why is no real title available?)
• A Characterization of Comparability Graphs and of Interval Graphs
• Algorithmic graph theory and perfect graphs
• Characterizing intersection classes of graphs
• Complement reducible graphs
• Every planar graph is the intersection graph of segments in the plane (extended abstract)
• Graph Classes: A Survey
• Graph algorithms. Edited by Guy Even. With a foreword by Richard M. Karp
• Implicat Representation of Graphs
• Local representations using very short labels
• Matrix characterizations of circular-arc graphs
• On the size of hereditary classes of graphs
• Permutation Graphs and Transitive Graphs
• Random Geometric Graphs
• Representation of a finite graph by a set of intervals on the real line
• String graphs. I: The number of critical nonstring graphs is infinite
• String graphs. II: Recognizing string graphs is NP-hard
• The On-Line Encyclopedia of Integer Sequences
• The Representation of a Graph by Set Intersections
• The speed of hereditary properties of graphs
• Threshold graphs and related topics
• Tolerance graphs
• Topics in Intersection Graph Theory
• Topology of Thin Film RC Circuits

Cited in

(5)

• Efficient local updates for undirected graphical models
• An efficient algorithm to recognize locally equivalent graphs
• An adjacency labeling scheme based on a decomposition of trees into caterpillars
• Algorithms and Computation
• Local Graph Exploration and Fast Property Testing

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Efficient local representations of graphs

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