Copertina

The complexity of testing all properties of planar graphs, and the role of isomorphism

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Basu, Sabyasachi, Kumar, Akash, Seshadhri, C.
Natura:	Preprint
Pubblicazione:	2021
Soggetti:	Data Structures and Algorithms Computational Complexity
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

A note on approximating the average degree of bounded arboricity graphs
di: Eden, Talya, et al.
Pubblicazione: (2026)

Smoothed analysis for graph isomorphism
di: Anastos, Michael, et al.
Pubblicazione: (2024)

On the complexity of global Roman domination problem in graphs
di: Reddy, Sangam Balchandar, et al.
Pubblicazione: (2026)

List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs
di: Esmer, Barış Can, et al.
Pubblicazione: (2022)

Random tensor isomorphism under orthogonal and unitary actions
di: Chizewer, Jeremy, et al.
Pubblicazione: (2026)

Self-referential instances of the dominating set problem are irreducible
di: Zhou, Guangyan
Pubblicazione: (2026)

Parameterized complexity of reconfiguration of atoms
di: Cooper, Alexandre, et al.
Pubblicazione: (2021)

The communication complexity of distributed estimation
di: Gopalan, Parikshit, et al.
Pubblicazione: (2025)

Halfspaces are hard to test with relative error
di: Chen, Xi, et al.
Pubblicazione: (2025)

Sublinear-query relative-error testing of halfspaces
di: Chen, Xi, et al.
Pubblicazione: (2026)

On the complexity and approximability of Bounded access Lempel Ziv coding
di: Cicalese, Ferdinando, et al.
Pubblicazione: (2024)

On girth and the parameterized complexity of token sliding and token jumping
di: Bartier, Valentin, et al.
Pubblicazione: (2020)

The complexity of finding and enumerating optimal subgraphs to represent spatial correlation
di: Enright, Jessica, et al.
Pubblicazione: (2020)

Superpolynomial smoothed complexity of 3-FLIP in Local Max-Cut
di: Michel, Lukas, et al.
Pubblicazione: (2023)

Additive approximation algorithm for geodesic centers in $δ$-hyperbolic graphs
di: Chakraborty, Dibyayan, et al.
Pubblicazione: (2024)

A fine-grained dichotomy for the center problem on Gromov hyperbolic graphs
di: Ducoffe, Guillaume
Pubblicazione: (2026)

A constant time complexity algorithm for the unbounded knapsack problem with bounded coefficients
di: Yang, Yang
Pubblicazione: (2024)

Polynomial kernels for edge modification problems towards block and strictly chordal graphs
di: Dumas, Maël, et al.
Pubblicazione: (2022)

Isometric path complexity of graphs
di: Chakraborty, Dibyayan, et al.
Pubblicazione: (2022)

Lower bounds on pure dynamic programming for connectivity problems on graphs of bounded path-width
di: Kluk, Kacper, et al.
Pubblicazione: (2025)

Reducing the Randomness in Partition Oracles for Bounded Degree Minor-Free Graphs
di: Kumar, Akash, et al.
Pubblicazione: (2026)

Computational hardness of detecting graph lifts and certifying lift-monotone properties of random regular graphs
di: Kunisky, Dmitriy, et al.
Pubblicazione: (2024)

Most Juntas Saturate the Hardcore Lemma
di: Kumar, Vinayak M.
Pubblicazione: (2025)

Inclusive and Exclusive Vertex Splitting into Specific Graph Classes: NP Hardness and Algorithms
di: Gaikwad, Ajinkya, et al.
Pubblicazione: (2025)

Parameterized Algorithms for Editing to Uniform Cluster Graph
di: Gaikwad, Ajinkya, et al.
Pubblicazione: (2024)

Precoloring extension with demands on paths
di: Das, Arun Kumar, et al.
Pubblicazione: (2025)

Linear Hashing Is Optimal
di: Jaber, Michael, et al.
Pubblicazione: (2025)

Algorithms and complexity for monitoring edge-geodetic sets in graphs
di: Foucaud, Florent, et al.
Pubblicazione: (2024)

On the Parameterized Complexity of Min-Sum-Radii
di: Kumar, Pankaj, et al.
Pubblicazione: (2026)

Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits
di: Kumar, Mrinal, et al.
Pubblicazione: (2024)

Deterministic factorization of constant-depth algebraic circuits in subexponential time
di: Bhattacharjee, Somnath, et al.
Pubblicazione: (2025)

Hardness of sampling for the anti-ferromagnetic Ising model on random graphs
di: Huang, Neng, et al.
Pubblicazione: (2024)

On the average-case complexity landscape for Tensor-Isomorphism-complete problems over finite fields
di: Li, Tiange, et al.
Pubblicazione: (2026)

On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP
di: S., Karthik C., et al.
Pubblicazione: (2024)

Sequence graphs realizations and ambiguity in language models
di: Khalife, Sammy, et al.
Pubblicazione: (2024)

Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof
di: S., Karthik C., et al.
Pubblicazione: (2023)

On Inapproximability of Reconfiguration Problems: PSPACE-Hardness and some Tight NP-Hardness Results
di: Guruswami, Venkatesan, et al.
Pubblicazione: (2023)

Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs
di: Kutner, David C., et al.
Pubblicazione: (2025)

Relative-error unateness testing
di: Chen, Xi, et al.
Pubblicazione: (2025)

Single-copy stabilizer testing
di: Hinsche, Marcel, et al.
Pubblicazione: (2024)