相关参考文献
注意:仅列出部分参考文献,下载原文获取全部文献信息。Succinct representation for (non)deterministic finite automata
Sankardeep Chakraborty et al.
JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2023)
Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number
Sankardeep Chakraborty et al.
THEORETICAL COMPUTER SCIENCE (2023)
Succinct navigational oracles for families of intersection graphs on a circle
Huseyin Acan et al.
THEORETICAL COMPUTER SCIENCE (2022)
Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS
Sankardeep Chakraborty et al.
JOURNAL OF COMBINATORIAL OPTIMIZATION (2019)
Space-Efficient DFS and Applications to Connectivity Problems: Simpler, Leaner, Faster
Torben Hagerup
ALGORITHMICA (2019)
Space Efficient Linear Time Algorithms for BFS, DFS and Applications
Niranka Banerjee et al.
THEORY OF COMPUTING SYSTEMS (2018)
Fully Functional Static and Dynamic Succinct Trees
Gonzalo Navarro et al.
ACM TRANSACTIONS ON ALGORITHMS (2014)
Compact Navigation and Distance Oracles for Graphs with Small Treewidth
Arash Farzan et al.
ALGORITHMICA (2014)
Succinct encoding of arbitrary graphs
Arash Farzan et al.
THEORETICAL COMPUTER SCIENCE (2013)
Succinct Representation of Labeled Graphs
Jeremy Barbay et al.
ALGORITHMICA (2012)
Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
Julia Boettcher et al.
EUROPEAN JOURNAL OF COMBINATORICS (2010)
Succinct representations of planar maps
L. Castelli Aleardi et al.
THEORETICAL COMPUTER SCIENCE (2008)
Rank and select revisited and extended
Veli Makinen et al.
THEORETICAL COMPUTER SCIENCE (2007)
Succinct Indexable Dictionaries with Applications to Encoding k-ary Trees, Prefix Sums and Multisets
Rajeev Raman et al.
ACM TRANSACTIONS ON ALGORITHMS (2007)