4.3 Article

Succinct data structure for path graphs ☆

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Computer Science, Hardware & Architecture

Succinct representation for (non)deterministic finite automata

Sankardeep Chakraborty et al.

Summary: (Non)-Deterministic finite automata, one of the simplest models of computation in automata theory, are studied in this paper through the lens of succinct data structures. The authors propose a data structure for deterministic automaton D that can determine whether D accepts a given string x in optimal time. Various time-space trade-offs are also considered. The authors also present a data structure for non-deterministic automaton N and provide efficient algorithms for performing standard operations on languages accepted by finite automata.

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2023)

Article Computer Science, Theory & Methods

Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number

Sankardeep Chakraborty et al.

Summary: In this paper, we propose parameterized compact data structures for interval graphs with bounded degree or bounded chromatic number. The space requirements for our data structures are analyzed, and it is shown that they take less space than existing upper bound results. Additionally, we introduce a new data structure for interval graphs with bounded chromatic number, which is more efficient than previous approaches. Finally, we extend our study to circular-arc graphs and provide parameterized compact data structures under degree or chromatic number constraints.

THEORETICAL COMPUTER SCIENCE (2023)

Article Computer Science, Theory & Methods

Succinct navigational oracles for families of intersection graphs on a circle

Huseyin Acan et al.

Summary: This paper investigates the problem of designing succinct navigational oracles and proposes a unified approach to represent various graph classes. The paper provides lower and upper bounds for these classes using a unified technique.

THEORETICAL COMPUTER SCIENCE (2022)

Article Computer Science, Interdisciplinary Applications

Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS

Sankardeep Chakraborty et al.

JOURNAL OF COMBINATORIAL OPTIMIZATION (2019)

Article Computer Science, Software Engineering

Space-Efficient DFS and Applications to Connectivity Problems: Simpler, Leaner, Faster

Torben Hagerup

ALGORITHMICA (2019)

Article Computer Science, Theory & Methods

Space Efficient Linear Time Algorithms for BFS, DFS and Applications

Niranka Banerjee et al.

THEORY OF COMPUTING SYSTEMS (2018)

Article Computer Science, Theory & Methods

Fully Functional Static and Dynamic Succinct Trees

Gonzalo Navarro et al.

ACM TRANSACTIONS ON ALGORITHMS (2014)

Article Computer Science, Software Engineering

Compact Navigation and Distance Oracles for Graphs with Small Treewidth

Arash Farzan et al.

ALGORITHMICA (2014)

Article Computer Science, Theory & Methods

Succinct encoding of arbitrary graphs

Arash Farzan et al.

THEORETICAL COMPUTER SCIENCE (2013)

Article Computer Science, Software Engineering

Succinct Representation of Labeled Graphs

Jeremy Barbay et al.

ALGORITHMICA (2012)

Article Mathematics

Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs

Julia Boettcher et al.

EUROPEAN JOURNAL OF COMBINATORICS (2010)

Article Computer Science, Theory & Methods

Succinct representations of planar maps

L. Castelli Aleardi et al.

THEORETICAL COMPUTER SCIENCE (2008)

Article Computer Science, Theory & Methods

Rank and select revisited and extended

Veli Makinen et al.

THEORETICAL COMPUTER SCIENCE (2007)

Article Computer Science, Theory & Methods

Succinct Indexable Dictionaries with Applications to Encoding k-ary Trees, Prefix Sums and Multisets

Rajeev Raman et al.

ACM TRANSACTIONS ON ALGORITHMS (2007)