An adjacency labeling scheme based on a decomposition of trees into caterpillars

DOI10.1007/978-3-031-06678-8_9OpenAlexW4285105434MaRDI QIDQ2169946

Avah Banerjee

Publication date: 30 August 2022

Full work available at URL: https://arxiv.org/abs/2201.04749

zbMATH Keywords

implicit representationhereditary classesclique-widths

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Asymptotically optimal induced universal graphs
• Block-graph width
• Compact representation of graphs of small clique-width
• Partitioned probe comparability graphs
• On probe permutation graphs
• On the OBDD size for graphs of bounded tree- and clique-width
• Efficient graph representations
• Query efficient implementation of graphs of bounded clique-width
• A data structure for dynamic trees
• Handle-rewriting hypergraph grammars
• An unexpected result in coding the vertices of a graph
• Adjacency Labeling Schemes and Induced-Universal Graphs
• On Some Simple Widths
• Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs
• Implicat Representation of Graphs
• Graph Classes: A Survey
• Sublinear Distance Labeling
• Optimal Induced Universal Graphs and Adjacency Labeling for Trees
• Near-Optimal Induced Universal Graphs for Bounded Degree Graphs
• Efficient Local Representations of Graphs
• Coding the vertexes of a graph

This page was built for publication: An adjacency labeling scheme based on a decomposition of trees into caterpillars