Image de couverture de livre

The complexity of finding and enumerating optimal subgraphs to represent spatial correlation

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Enright, Jessica, Lee, Duncan, Meeks, Kitty, Pettersson, William, Sylvester, John
Format:	Preprint
Publié:	2020
Sujets:	Data Structures and Algorithms Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Nearly optimal independence oracle algorithms for edge estimation in hypergraphs
par: Dell, Holger, et autres
Publié: (2022)

Cops and Robbers on Multi-Layer Graphs
par: Enright, Jessica, et autres
Publié: (2023)

On the instance optimality of detecting collisions and subgraphs
par: Ben-Eliezer, Omri, et autres
Publié: (2023)

Self-referential instances of the dominating set problem are irreducible
par: Zhou, Guangyan
Publié: (2026)

Temporal Triadic Closure: Finding Dense Structures in Social Networks That Evolve
par: Davot, Tom, et autres
Publié: (2024)

A general framework for finding diverse solutions via network flow and its applications
par: Iwamasa, Yuni, et autres
Publié: (2025)

The communication complexity of distributed estimation
par: Gopalan, Parikshit, et autres
Publié: (2025)

Parameterized complexity of reconfiguration of atoms
par: Cooper, Alexandre, et autres
Publié: (2021)

On optimal distinguishers for Planted Clique
par: Nagda, Ansh, et autres
Publié: (2025)

A New Temporal Interpretation of Cluster Editing
par: Bocci, Cristiano, et autres
Publié: (2022)

On girth and the parameterized complexity of token sliding and token jumping
par: Bartier, Valentin, et autres
Publié: (2020)

On the complexity and approximability of Bounded access Lempel Ziv coding
par: Cicalese, Ferdinando, et autres
Publié: (2024)

The complexity of testing all properties of planar graphs, and the role of isomorphism
par: Basu, Sabyasachi, et autres
Publié: (2021)

Superpolynomial smoothed complexity of 3-FLIP in Local Max-Cut
par: Michel, Lukas, et autres
Publié: (2023)

A constant time complexity algorithm for the unbounded knapsack problem with bounded coefficients
par: Yang, Yang
Publié: (2024)

List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs
par: Esmer, Barış Can, et autres
Publié: (2022)

$O(n +f(k))$: Truly Linear FPT
par: Bumpus, Benjamin Merlin, et autres
Publié: (2026)

On the complexity of global Roman domination problem in graphs
par: Reddy, Sangam Balchandar, et autres
Publié: (2026)

On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP
par: S., Karthik C., et autres
Publié: (2024)

DNF formulas are efficiently testable with relative error
par: Chen, Xi, et autres
Publié: (2026)

A lossless a priori splitting rule for split-delivery routing problems
par: Jones, Bo, et autres
Publié: (2025)

Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits
par: Kumar, Mrinal, et autres
Publié: (2024)

Parameterized Algorithms for Balanced Cluster Edge Modification Problems
par: Madathil, Jayakrishnan, et autres
Publié: (2024)

On the average-case complexity landscape for Tensor-Isomorphism-complete problems over finite fields
par: Li, Tiange, et autres
Publié: (2026)

On the complexity of symmetric vs. functional PCSPs
par: Nakajima, Tamio-Vesa, et autres
Publié: (2022)

On the parameterized complexity of Broadcast Independence and Broadcast Packing
par: Dumont, Joanne, et autres
Publié: (2026)

Centrality of shortest paths: Algorithms and complexity results
par: Phosavanh, Johnson, et autres
Publié: (2024)

Asymptotically Optimal Hardness for $k$-Set Packing and $k$-Matroid Intersection
par: Lee, Euiwoong, et autres
Publié: (2024)

Stable algorithms cannot reliably find isolated perceptron solutions
par: Gong, Shuyang, et autres
Publié: (2026)

Improved Algorithm for Permutation Testing
par: Zhang, Xiaojin
Publié: (2020)

On the Mysteries of MAX NAE-SAT
par: Brakensiek, Joshua, et autres
Publié: (2020)

Removable Online Knapsack and Advice
par: Böckenhauer, Hans-Joachim, et autres
Publié: (2020)

The Query Complexity of Local Search and Brouwer in Rounds
par: Brânzei, Simina, et autres
Publié: (2020)

Neighborhood-Aware Graph Labeling Problem
par: Shahverdikondori, Mohammad, et autres
Publié: (2026)

The Price of Being Partial: Complexity of Partial Generalized Dominating Set on Bounded-Treewidth Graphs
par: Greilhuber, Jakob, et autres
Publié: (2025)

Lazy Kronecker Product
par: Song, Zhao
Publié: (2026)

The Trichotomy of Regular Property Testing
par: Bathie, Gabriel, et autres
Publié: (2025)

Complexity of Local Search for Euclidean Clustering Problems
par: Manthey, Bodo, et autres
Publié: (2023)

Can You Link Up With Treewidth?
par: Curticapean, Radu, et autres
Publié: (2024)

Downward self-reducibility in the total function polynomial hierarchy
par: Gajulapalli, Karthik, et autres
Publié: (2025)