Copertina

Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Balakrishnan, Girish, Chakraborty, Sankardeep, Narayanaswamy, N S, Sadakane, Kunihiko
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Succinct Data Structure for Graphs with $d$-Dimensional $t$-Representation
di: Balakrishnan, Girish, et al.
Pubblicazione: (2023)

Succinct Data Structures for Baxter Permutation and Related Families
di: Chakraborty, Sankardeep, et al.
Pubblicazione: (2024)

Variations on the Problem of Identifying Spectrum-Preserving String Sets
di: Chakraborty, Sankardeep, et al.
Pubblicazione: (2026)

A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs
di: Hamada, Kou, et al.
Pubblicazione: (2024)

Cluster Vertex Deletion on Chordal Graphs
di: Cao, Yixin, et al.
Pubblicazione: (2026)

Revisiting Token Sliding on Chordal Graphs
di: Adak, Rajat, et al.
Pubblicazione: (2025)

Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth
di: Wlodarczyk, Michal
Pubblicazione: (2023)

Breaking the Barrier $2^k$ for Subset Feedback Vertex Set in Chordal Graphs
di: Bai, Tian, et al.
Pubblicazione: (2022)

Succinct Data Structures for Segments
di: Bille, Philip, et al.
Pubblicazione: (2024)

A faster algorithm for Vertex Cover parameterized by solution size
di: Harris, David G., et al.
Pubblicazione: (2022)

Succinct Graph Representations and Algorithmic Applications
di: Ullah, Ahammed, et al.
Pubblicazione: (2026)

Compressibility Measures and Succinct Data Structures for Piecewise Linear Approximations
di: Ferragina, Paolo, et al.
Pubblicazione: (2025)

Counting and Sampling Labeled Chordal Graphs in Polynomial Time
di: Hebert-Johnson, Ursula, et al.
Pubblicazione: (2023)

Sampling Unlabeled Chordal Graphs in Expected Polynomial Time
di: Hébert-Johnson, Úrsula, et al.
Pubblicazione: (2025)

Exactly Hittable Interval Graphs
di: Dhannya, S. M., et al.
Pubblicazione: (2023)

Space-Efficient Graph Coarsening with Applications to Succinct Planar Encodings
di: Hammer, Nina, et al.
Pubblicazione: (2022)

Succinct Dynamic Rank/Select: Bypassing the Tree-Structure Bottleneck
di: Kuszmaul, William, et al.
Pubblicazione: (2025)

Space-Efficient Depth-First Search via Augmented Succinct Graph Encodings
di: Elberfeld, Michael, et al.
Pubblicazione: (2025)

Succinct Planar Encoding with Minor Operations
di: Kammer, Frank, et al.
Pubblicazione: (2023)

Succinct Preferential Attachment Graphs
di: Alaoui, Ziad Ismaili, et al.
Pubblicazione: (2025)

Approximation Ratio of the Min-Degree Greedy Algorithm for Maximum Independent Set on Interval and Chordal Graphs
di: Chaplick, Steven, et al.
Pubblicazione: (2024)

SPIDER: Improved Succinct Rank and Select Performance
di: Laws, Matthew D., et al.
Pubblicazione: (2024)

Cut Sparsification and Succinct Representation of Submodular Hypergraphs
di: Kenneth, Yotam, et al.
Pubblicazione: (2023)

Parameterized Algorithms for the Steiner Arborescence Problem on a Hypercube
di: Mahapatra, Sugyani, et al.
Pubblicazione: (2021)

Structural Parameterizations of Vertex Integrity
di: Gima, Tatsuya, et al.
Pubblicazione: (2023)

Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths
di: Bentert, Matthias, et al.
Pubblicazione: (2024)

Rooting Out Entropy: Optimal Tree Extraction for Ultra-Succinct Graphs
di: Alaoui, Ziad Ismaili, et al.
Pubblicazione: (2026)

The Connected k-Vertex One-Center Problem on Graphs
di: Zhang, Jingru
Pubblicazione: (2024)

Path-Reporting Distance Oracles for Vertex-Labeled Graphs
di: Neiman, Ofer, et al.
Pubblicazione: (2026)

Equivalence Testing: The Power of Bounded Adaptivity
di: Chakraborty, Diptarka, et al.
Pubblicazione: (2024)

Succinct Encodings of Binary Trees with Application to AVL Trees
di: Chizewer, Jeremy, et al.
Pubblicazione: (2023)

Structural Parameterizations of the Biclique-Free Vertex Deletion Problem
di: Goldmann, Lito, et al.
Pubblicazione: (2023)

Cut-Preserving Vertex Sparsifiers for Planar and Quasi-bipartite Graphs
di: Chen, Yu, et al.
Pubblicazione: (2024)

Directed and Undirected Vertex Connectivity Problems are Equivalent for Dense Graphs
di: Fischer, Olivier, et al.
Pubblicazione: (2025)

Connectivity Certificate against Bounded-Degree Faults: Simpler, Better and Supporting Vertex Faults
di: Parter, Merav, et al.
Pubblicazione: (2024)

Cutwidth Bounds via Vertex Partitions
di: Amarilli, Antoine, et al.
Pubblicazione: (2025)

Algebraic Vertex Ordering of a Sparse Graph for Adjacency Access Locality and Graph Compression
di: Floros, Dimitris, et al.
Pubblicazione: (2024)

Limits of Chordal Graphs With Bounded Tree‐Width
di: Jordi Castellví, et al.
Pubblicazione: (2025)

Enumeration kernels for Vertex Cover and Feedback Vertex Set
di: Bougeret, Marin, et al.
Pubblicazione: (2025)

New Approximations for Temporal Vertex Cover on Always Star Temporal Graphs
di: Heck, Sophia, et al.
Pubblicazione: (2026)