scientific article; zbMATH DE number 7561711
From MaRDI portal
Publication:5092430
DOI10.4230/LIPIcs.MFCS.2019.67MaRDI QIDQ5092430
Sankardeep Chakraborty, Kunihiko Sadakane
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1906.07871
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (4)
Optimal In-place Algorithms for Basic Graph Problems ⋮ Succinct encodings for families of interval graphs ⋮ Succinct data structure for path graphs ⋮ Frameworks for designing in-place graph algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- A compact encoding of plane triangulations with efficient query supports
- Succinct representations of permutations and functions
- Succinct representation of dynamic trees
- The level ancestor problem simplified
- Computing an st-numbering
- A note on finding the bridges of a graph
- Succinct data structures for families of interval graphs
- Space efficient linear time algorithms for BFS, DFS and applications
- Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits
- Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS
- A uniform paradigm to succinctly encode various families of trees
- Succinct Representation of Balanced Parentheses and Static Trees
- Finding Dominators in Directed Graphs
- Efficient Planarity Testing
- A Framework for In-place Graph Algorithms
- Succinct Representation of Labeled Graphs
- Depth-First Search and Linear Graph Algorithms
- Fast and compact planar embeddings
This page was built for publication:
