Imagen de Portada

Structural Origins of Cubic Complexity in Pebble Motion

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Nakamigawa, Tomoki, Sakuma, Tadashi
Formato:	Preprint
Publicado:	2025
Materias:	Combinatorics Computational Complexity Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Complexity Aspects of Homomorphisms of Ordered Graphs
por: Čertík, Michal, et al.
Publicado: (2025)

Computational Complexity of Covering Two-vertex Multigraphs with Semi-edges
por: Bok, Jan, et al.
Publicado: (2021)

Complexity results for a cops and robber game on directed graphs
por: Ben-Ameur, Walid, et al.
Publicado: (2024)

Complexity of approximate conflict-free, linearly-ordered, and nonmonochromatic hypergraph colourings
por: Nakajima, Tamio-Vesa, et al.
Publicado: (2025)

Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles
por: Le, Hoang-Oanh, et al.
Publicado: (2023)

Factorization norms and an inverse theorem for MaxCut
por: Balla, Igor, et al.
Publicado: (2025)

Maker-Maker games of rank 4 are PSPACE-complete
por: Galliot, Florian, et al.
Publicado: (2025)

Non-crossing $H$-graphs: a generalization of proper interval graphs admitting FPT algorithms
por: Bonomo-Braberman, Flavia, et al.
Publicado: (2025)

VC-Dimension vs Degree: An Uncertainty Principle for Boolean Functions
por: Chang, Fan, et al.
Publicado: (2025)

Approximate cycle double cover
por: Ghanbari, Babak, et al.
Publicado: (2025)

Matching Cut and Variants on Bipartite Graphs of Bounded Radius and Diameter
por: Lucke, Felicia
Publicado: (2025)

Finding Minimum Matching Cuts in $H$-free Graphs
por: Lucke, Felicia, et al.
Publicado: (2025)

Finding d-Cuts in Claw-free Graphs
por: Ahn, Jungho, et al.
Publicado: (2025)

Graph Irregularity via Edge Deletions
por: Bensmail, Julien, et al.
Publicado: (2025)

Pseudorandomness of Expander Walks via Fourier Analysis on Groups
por: Jeronimo, Fernando Granha, et al.
Publicado: (2025)

On Computational Aspects of Ordered Matching Problems
por: Čertík, Michal, et al.
Publicado: (2025)

More efficient sifting for grid norms, and applications to multiparty communication complexity
por: Kelley, Zander, et al.
Publicado: (2025)

4-uniform Maker-Breaker and Maker-Maker games are PSPACE-complete
por: Galliot, Florian
Publicado: (2025)

Hardness of Finding Kings and Strong Kings
por: Alaoui, Ziad Ismaili, et al.
Publicado: (2025)

On the hardness of recognizing graphs of small mim-width and its variants
por: la Tour, Max Dupré, et al.
Publicado: (2025)

On Computational Aspects of Cores of Ordered Graphs
por: Čertík, Michal, et al.
Publicado: (2025)

Sparse High Dimensional Expanders via Local Lifts
por: Yaacov, Inbar Ben, et al.
Publicado: (2024)

Temporal Reachability Dominating Sets: contagion in temporal graphs
por: Kutner, David C., et al.
Publicado: (2023)

On full-separating sets and related codes in graphs
por: Chakraborty, Dipayan, et al.
Publicado: (2024)

Combinatorial refinement on circulant graphs
por: Kluge, Laurence
Publicado: (2022)

Chernoff Bounds and Reverse Hypercontractivity on HDX
por: Dikstein, Yotam, et al.
Publicado: (2024)

Determining the Outerthickness of Graphs Is NP-Hard
por: Lee, Pin-Hsian, et al.
Publicado: (2026)

Local Homophily on Bicolored Graphs is $\mathbf{P}$-complete
por: Concha-Vega, Pablo
Publicado: (2026)

Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes
por: Kopparty, Swastik, et al.
Publicado: (2023)

Atropos-k is PSPACE-complete
por: Yang, Chao, et al.
Publicado: (2024)

On the satisfiability of random $3$-SAT formulas with $k$-wise independent clauses
por: Caragiannis, Ioannis, et al.
Publicado: (2024)

A Linear Kernel for Planar Vector Domination
por: Sahili, Mahabba El, et al.
Publicado: (2023)

Reconfiguring Graph Homomorphisms on the Sphere
por: Lee, Jae-Baek, et al.
Publicado: (2018)

The Interplay Between Domination and Separation in Graphs
por: Chakraborty, Dipayan, et al.
Publicado: (2026)

Hierarchies of Minion Tests for PCSPs through Tensors
por: Ciardo, Lorenzo, et al.
Publicado: (2022)

On the complexity of the Maker-Breaker happy vertex game
por: Hilaire, Mathieu, et al.
Publicado: (2026)

On the parameterized complexity of the Maker-Breaker domination game
por: Bagan, Guillaume, et al.
Publicado: (2026)

Algorithmic methods of finite discrete structures. Graph clique problem
por: Kurapov, Sergey, et al.
Publicado: (2024)

Testing Isomorphism of Graphs in Polynomial Time
por: Xue, Rui
Publicado: (2023)

Equality cases of the Stanley--Yan log-concave matroid inequality
por: Chan, Swee Hong, et al.
Publicado: (2024)