Image de couverture de livre

Is it easier to count communities than find them?

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Rush, Cynthia, Skerman, Fiona, Wein, Alexander S., Yang, Dana
Format:	Preprint
Publié:	2022
Sujets:	Statistics Theory Computational Complexity Data Structures and Algorithms Combinatorics Machine Learning 05C80, 62F03, 68Q25 F.2; G.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Answering Related Questions
par: Bonnet, Édouard
Publié: (2025)

Coloring Hardness on Low Twin-Width Graphs
par: Bonnet, Édouard
Publié: (2025)

On weighted graph separation problems and flow-augmentation
par: Kim, Eun Jung, et autres
Publié: (2022)

Evolomino is NP-complete
par: Nikolaev, Andrei V.
Publié: (2025)

O(1) Insertion for Random Walk d-ary Cuckoo Hashing up to the Load Threshold
par: Bell, Tolson, et autres
Publié: (2024)

Fast Shortest Path in Graphs With Sparse Signed Tree Models and Applications
par: Bonnet, Édouard, et autres
Publié: (2026)

Mim-Width is paraNP-complete
par: Bergougnoux, Benjamin, et autres
Publié: (2025)

Treewidth Inapproximability and Tight ETH Lower Bound
par: Bonnet, Édouard
Publié: (2024)

Parallel Algorithms for Group Isomorphism via Code Equivalence
par: Levet, Michael
Publié: (2026)

Overlapping Biclustering
par: Bentert, Matthias, et autres
Publié: (2025)

Simple minimally unsatisfiable subsets of 2-CNFs
par: Kullmann, Oliver, et autres
Publié: (2026)

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought?
par: Bannach, Max, et autres
Publié: (2025)

Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile
par: Gu, Qian-Ping, et autres
Publié: (2025)

Exact and Approximate High-Multiplicity Scheduling on Identical Machines
par: Jansen, Klaus, et autres
Publié: (2024)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
par: Hougardy, Stefan, et autres
Publié: (2025)

Logarithmic Weisfeiler--Leman and Treewidth
par: Levet, Michael, et autres
Publié: (2023)

Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler--Leman
par: Levet, Michael, et autres
Publié: (2023)

Optimal non-adaptive algorithm for edge estimation
par: Bishnu, Arijit, et autres
Publié: (2025)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
par: DasGupta, Bhaskar, et autres
Publié: (2026)

Induced Disjoint Paths Without an Induced Minor
par: Aboulker, Pierre, et autres
Publié: (2025)

Interval Graphs are Reconstructible
par: Heinrich, Irene, et autres
Publié: (2025)

Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique
par: Chen, Yijia, et autres
Publié: (2023)

Competitive Query Minimization for Stable Matching with One-Sided Uncertainty
par: Bampis, Evripidis, et autres
Publié: (2024)

On Solving Simple Curved Nonograms
par: Löffler, Maarten, et autres
Publié: (2025)

Maximum Matchings in Geometric Intersection Graphs
par: Bonnet, Édouard, et autres
Publié: (2019)

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

Sublinear-Time Computation in the Presence of Online Erasures
par: Kalemaj, Iden, et autres
Publié: (2021)

I/O complexity and pebble games with partial computations
par: Sobczyk, Aleksandros
Publié: (2024)

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness
par: Grochow, Joshua A., et autres
Publié: (2025)

A 60-Addition, Rank-23 Scheme for Exact 3x3 Matrix Multiplication
par: Stapleton, Joshua
Publié: (2025)

A Simple and Efficient Algorithm for Sorting Signed Permutations by Reversals
par: Swenson, Krister M.
Publié: (2024)

Which graph motif parameters count?
par: Bläser, Markus, et autres
Publié: (2025)

The Word Problem for Products of Symmetric Groups
par: Simon, Hans U.
Publié: (2025)

The framework to unify all complexity dichotomy theorems for Boolean tensor networks
par: Xia, Mingji
Publié: (2026)

On the twin-width of near-regular graphs
par: Heinrich, Irene, et autres
Publié: (2025)

Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes
par: Golovach, Petr A., et autres
Publié: (2022)

Odd Cycle Transversal on $P_5$-free Graphs in Polynomial Time
par: Agrawal, Akanksha, et autres
Publié: (2024)

Algorithmic Barriers to Detecting and Repairing Structural Overspecification in Adaptive Data-Structure Selection
par: Alpay, Faruk, et autres
Publié: (2026)

Quantum Search without Global Diffusion
par: Burke, John, et autres
Publié: (2026)

How to Compute a Moving Sum
par: Maslen, David K., et autres
Publié: (2025)