scientific article; zbMATH DE number 7561708

DOI10.4230/LIPIcs.MFCS.2019.64MaRDI QIDQ5092427

Torben Hagerup

Publication date: 21 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

succinct data structuresspace efficiencyamortizationin-place chain techniquebounded universes

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Sorting and ranking of self-delimiting numbers with applications to tree isomorphism

Cites Work

• Space-efficient biconnected components and recognition of outerplanar graphs
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• Space-efficient Euler partition and bipartite edge coloring
• Highly succinct dynamic data structures
• Fast breadth-first search in still less space
• Improved Space Efficient Algorithms for BFS, DFS and Applications
• Changing base without losing space
• Space-efficient Basic Graph Algorithms
• Simple 2^f-Color Choice Dictionaries

This page was built for publication: