Imagen de Portada

Revisiting Token Sliding on Chordal Graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Adak, Rajat, Nanoti, Saraswati Girish, Tale, Prafullkumar
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Double Exponential Lower Bound for Telephone Broadcast
por: Tale, Prafullkumar
Publicado: (2024)

Geodetic Set on Graphs of Constant Pathwidth and Feedback Vertex Set Number
por: Tale, Prafullkumar
Publicado: (2025)

A Finer View of the Parameterized Landscape of Labeled Graph Contractions
por: Mathur, Yashaswini, et al.
Publicado: (2025)

Eternal Vertex Cover on Bipartite and Co-Bipartite Graphs
por: Misra, Neeldhara, et al.
Publicado: (2022)

A Little Aggression Goes a Long Way
por: Krishnan, Jyothi, et al.
Publicado: (2024)

A Single Exponential-Time FPT Algorithm for Cactus Contraction
por: Krithika, R., et al.
Publicado: (2025)

Revisiting Path Contraction and Cycle Contraction
por: Krithika, R., et al.
Publicado: (2024)

Structural Parameterization of Locating-Dominating Set and Test Cover
por: Chakraborty, Dipayan, et al.
Publicado: (2024)

Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage
por: Balakrishnan, Girish, et al.
Publicado: (2024)

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

Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover
por: Chakraborty, Dipayan, et al.
Publicado: (2024)

Path Contraction Faster than $2^n$
por: Agrawal, Akanksha, et al.
Publicado: (2025)

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

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

Parameterized complexity of isometric path partition: treewidth and diameter
por: Chakraborty, Dibyayan, et al.
Publicado: (2025)

Directed Token Sliding
por: Banerjee, Niranka, et al.
Publicado: (2024)

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

Algorithms and Hardness for Geodetic Set on Tree-like Digraphs
por: Foucaud, Florent, et al.
Publicado: (2026)

Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction
por: Krithika, R., et al.
Publicado: (2023)

Robust Contraction Decomposition for Minor-Free Graphs and its Applications
por: Bandyapadhyay, Sayan, et al.
Publicado: (2024)

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

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

Conflict and Fairness in Resource Allocation
por: Bandopadhyay, Susobhan, et al.
Publicado: (2024)

Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth or Vertex Cover
por: Foucaud, Florent, et al.
Publicado: (2023)

Metric Dimension and Geodetic Set Parameterized by Vertex Cover
por: Foucaud, Florent, et al.
Publicado: (2024)

Approximate Minimum Sum Colorings and Maximum $k$-Colorable Subgraphs of Chordal Graphs
por: DeHaan, Ian, et al.
Publicado: (2024)

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

Sequentially Swapping Tokens: Further on Graph Classes
por: Kiya, Hironori, et al.
Publicado: (2022)

Word Break on SLP-Compressed Texts
por: De, Rajat, et al.
Publicado: (2025)

Optimal Random Access and Conditional Lower Bounds for 2D Compressed Strings
por: De, Rajat, et al.
Publicado: (2025)

Grammar Boosting: A New Technique for Proving Lower Bounds for Computation over Compressed Data
por: De, Rajat, et al.
Publicado: (2023)

m-Eternal Domination and Variants on Some Classes of Finite and Infinite Graphs
por: Calamoneri, Tiziana, et al.
Publicado: (2025)

Interval Selection in Sliding Windows
por: Alexandru, Cezar-Mihail, et al.
Publicado: (2024)

Revisiting Local PageRank Estimation on Undirected Graphs: Simple and Optimal
por: Wang, Hanzhi
Publicado: (2024)

Fair Center Clustering in Sliding Windows
por: Ceccarello, Matteo, et al.
Publicado: (2025)

Fair Clustering in the Sliding Window Model
por: Cohen-Addad, Vincent, et al.
Publicado: (2025)

Approximate Graph Propagation Revisited: Dynamic Parameterized Queries, Tighter Bounds and Dynamic Updates
por: Zhao, Zhuowei, et al.
Publicado: (2025)

Sliding Block (Slick) Hashing: An Implementation & Benchmarks
por: Oberst, Jan
Publicado: (2024)

Sparse Neighborhood Graph-Based Approximate Nearest Neighbor Search Revisited: Theoretical Analysis and Optimization
por: Ma, Xinran, et al.
Publicado: (2025)

Optimal Approximate Matrix Multiplication over Sliding Window
por: Xian, Haoming, et al.
Publicado: (2025)