arXiv · cond-mat/0104115
Polynomial Observables in the Graph Partitioning Problem
Abstract
Although NP-Complete problems are the most difficult decisional problems, it is possible to discover in them polynomial (or easy) observables. We study the Graph Partitioning Problem showing that it is possible to recognize in it two correlated polynomial observables. The particular behaviour of one of them with respect to the connectivity of the graph suggests the presence of a phase transition in partitionability.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
M. A. Marchisio. 2001-04-06. Polynomial Observables in the Graph Partitioning Problem. https://doi.org/10.1142/s0129183101001456
Cite the original work for its findings. Save a collection to share your selection of sources.