Polynomial Observables in the Graph Partitioning Problem

Details Polynomial Observables in the Graph Partitioning Problem Polynomial Observables in the Graph Partitioning Problem

2001-04-06

arxiv.org/abs/cond-mat/0104115v1

Int.Journ.Mod.Phys.C,Vol.12,No.1 (2001) 13-18

Physics

Condensed Matter

7 pages, 2 figures

Scientific paper

10.1142/S0129183101001456

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.

Affiliated with

Also associated with

No associations

Rating

Polynomial Observables in the Graph Partitioning Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Polynomial Observables in the Graph Partitioning Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Polynomial Observables in the Graph Partitioning Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-657044