Succinct Data Structures for Families of Interval Graphs

@inproceedings{Acan2019SuccinctDS,
  title={Succinct Data Structures for Families of Interval Graphs},
  author={H{\"u}seyin Acan and Sankardeep Chakraborty and Seungbum Jo and S. Srinivasa Rao},
  booktitle={Workshop on Algorithms and Data Structures},
  year={2019}
}
We consider the problem of designing succinct data structures for interval graphs with $n$ vertices while supporting degree, adjacency, neighborhood and shortest path queries in optimal time in the $\Theta(\log n)$-bit word RAM model. The degree query reports the number of incident edges to a given vertex in constant time, the adjacency query returns true if there is an edge between two vertices in constant time, the neighborhood query reports the set of all adjacent vertices in time… 

Succinct Data Structure for Path Graphs

This work considers the problem of designing a succinct data structure for path graphs with n vertices while supporting degree, adjacency, and neighborhood queries efficiently, and provides two solutions that permits a simple and efficient implementation at the expense of more space.

Succinct Encodings for Families of Interval Graphs

This work designs succinct data structures for interval graphs with n vertices while supporting degree, adjacency, neighborhood and shortest path queries in optimal time, and extends these ideas to other variants of interval graphs, for example, proper/unit intervals, k-improper intervals, and circular-arc graphs.

Indexing Graph Search Trees and Applications

We consider the problem of compactly representing the Depth First Search (DFS) tree of a given undirected or directed graph having $n$ vertices and $m$ edges while supporting various DFS related

Succinct Encodings for Families of Interval Graphs

This work designs succinct data structures for interval graphs with n vertices while supporting degree, adjacency, neighborhood and shortest path queries in optimal time and extends these ideas to other variants of interval graphs, for example, proper/unit interval graphs.

Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees

We present the first succinct distance oracles for (unweighted) interval graphs and related classes of graphs, using a novel succinct data structure for ordinal trees that supports the mapping

Shorter Labeling Schemes for Planar Graphs

This work designs a labeling scheme with labels of bit length that generalizes to graphs of bounded Euler genus with the same label length up to a second-order term, improving the previous best upper bound of $n^{2+o(1)}$.

Compact Representation of Graphs with Small Bandwidth and Treedepth

  • Shahin Kamali
  • Computer Science, Mathematics
    2020 Data Compression Conference (DCC)
  • 2020
A lower bound is presented that certifies the oracle is succinct for certain values of k ∊ o(n) for graphs of bandwidth k and size n.

Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs

This work designs succinct encodings of series-parallel, block-cactus and 3-leaf power graphs while supporting the basic navigational queries such as degree, adjacency and neighborhood optimally in the RAM model with logarithmic word size to provide succinct data structures with optimal query support for the first time in the literature.

Breadth-First Rank/Select in Succinct Trees and Distance Oracles for Interval Graphs

We present the first succinct data structure for ordinal trees that supports the mapping between the preorder (i.e., depth-first) ranks and level-order (breadth-first) ranks of nodes in constant

References

SHOWING 1-10 OF 52 REFERENCES

Succinct Data Structures for Chordal Graphs

A n log n+o(n log n) bit data structure is given to answer the approximate distance query to within an additive constant of 1 in O(1) time to study the problem of succinctly storing a static chordal graph to answer adjacency, degree, neighbourhood and shortest path queries.

Succinct encoding of arbitrary graphs

Indexing Graph Search Trees and Applications

We consider the problem of compactly representing the Depth First Search (DFS) tree of a given undirected or directed graph having $n$ vertices and $m$ edges while supporting various DFS related

Solving the all-pair shortest path query problem on interval and circular-arc graphs

This paper shows that, after sorting the input intervals by their endpoints, a data structure can be constructed sequentially in O(n) time and O( n) space; using this data structure, each query on the length of the shortest path between any two intervals can be answered in O (1) time.

Optimal Distance Labeling for Interval Graphs and Related Graph Families

A distance labeling scheme is a distributed graph representation that assigns labels to the vertices and enables answering distance queries between any pair $(x,y)$ of vertices by using only the

Compact Navigation and Distance Oracles for Graphs with Small Treewidth

Given an unlabeled, unweighted, and undirected graph with n vertices and small (but not necessarily constant) treewidth k, we consider the problem of preprocessing the graph to build space-efficient

Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing

A succinct representation of a set of n points on an n ×n grid using n + o(n\lg n) bits to support orthogonal range counting in time, and range reporting in k time, achieves an improvement on query time by a factor of $\lg\ lg n$ upon the previous result of Makinen and Navarro.

On the Enumeration of Interval Graphs

We present upper and lower bounds for the number $i_n$ of interval graphs on $n$ vertices. Answering a question posed by Hanlon, we show that the ordinary generating function $I(x) = \sum_{n\ge 0}

A Framework for In-place Graph Algorithms

It is shown that a simple natural relaxation of ROM model allows us to implement fundamental graph search methods like BFS and DFS more space efficiently than in ROM, and the model is more powerful than ROM if L !
...