Simple 2^f-Color Choice Dictionaries

DOI10.4230/LIPIcs.ISAAC.2018.66OpenAlexW2907489937MaRDI QIDQ5091061

Frank Kammer, Andrej Sajenko

Publication date: 21 July 2022

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/10014/pdf/LIPIcs-ISAAC-2018-66.pdf/

zbMATH Keywords

succinctword RAMspace efficient

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (3)

Space-efficient vertex separators for treewidth ⋮ Sorting and ranking of self-delimiting numbers with applications to tree isomorphism ⋮ Unnamed Item

Cites Work

• Space-efficient biconnected components and recognition of outerplanar graphs
• Space-efficient Euler partition and bipartite edge coloring
• Improved Space Efficient Algorithms for BFS, DFS and Applications
• Optimal Time-Space Tradeoff for the 2D Convex-Hull Problem
• Depth-First Search Using $$O(n)$$ Bits
• Space-efficient Basic Graph Algorithms
• Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs
• Space-Efficient Plane-Sweep Algorithms.
• Priority Queues and Sorting for Read-Only Data
• A Framework for In-place Graph Algorithms

This page was built for publication: Simple 2^f-Color Choice Dictionaries