Graph Decomposition Is NP-Complete: A Complete Proof of Holyer's Conjecture

SIAM Journal on Computing - United States
doi 10.1137/s0097539792229507
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

Theory-Contraction Is NP-Complete

Logic Journal of the IGPL
Philosophy
2003English

Elastic Image Matching Is NP-complete

Pattern Recognition Letters
Signal ProcessingComputer VisionPattern RecognitionArtificial IntelligenceSoftware
2003English

Call Tree Reversal Is NP-Complete

Lecture Notes in Computational Science and Engineering
ControlCombinatoricsDiscrete MathematicsSimulationEngineeringOptimizationModelingComputational Mathematics
2008English

Sparse Complete Sets for NP: Solution of a Conjecture of Berman and Hartmanis

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
1982English

Revising Distributed UNITY Programs Is NP-Complete

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

Testing Orientability for Matroids Is NP-Complete

Advances in Applied Mathematics
Applied Mathematics
1999English

Checking Consistency of Pedigree Information Is NP-complete (Preliminary Report)

BRICS Report Series
2002English

An NP-complete Matching Problem

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
1980English

The Multivariate Quadratic Power Problem Over Zn Is Np-Complete

Information Technology and Control
ControlSystems EngineeringComputer Science ApplicationsElectricalElectronic Engineering
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy