title: Network conduciveness with application to the graph-coloring and independent-set optimization transitions.
abstract: BACKGROUND
  Given an undirected graph, we consider the two problems of combinatorial optimization, which ask that its chromatic and independence numbers be found. Although both problems are NP-hard, when either one is solved on the incrementally denser graphs of a random sequence, at certain critical values of the number of edges, it happens that the transition to the next value causes optimal solutions to be obtainable substantially more easily than right before it.
  
  
  RESULTS
  We introduce the notion of a network's conduciveness, a probabilistically interpretable measure of how the network's structure allows it to be conducive to roaming agents, in certain conditions, from one portion of the network to another. We demonstrate that the performance jumps of graph coloring and independent sets at the critical-value transitions in the number of edges can be understood by resorting to the network that represents the solution space of the problems for each graph and examining its conduciveness between the non-optimal solutions and the optimal ones. Right past each transition, this network becomes strikingly more conducive in the direction of the optimal solutions than it was just before it, while at the same time becoming less conducive in the opposite direction.
  
  
  CONCLUSIONS
  Network conduciveness provides a useful conceptual framework for explaining the performance jumps associated with graph coloring and independent sets. We believe it may also become instrumental in helping clarify further issues related to NP-hardness that remain poorly understood. Additionally, it may become useful also in other areas in which network theory has a role to play.
authors.affiliation: Programa de Engenharia de Sistemas e Computação, Instituto Alberto Luiz Coimbra de Pós-Graduação e Pesquisa de Engenharia (COPPE), Universidade Federal do Rio de Janeiro, Rio de Janeiro, Brazil. valmir@cos.ufrj.br
authors.forename: Valmir C
authors.initials: VC
authors.lastname: Barbosa
mesh_terms: D000465:Algorithms; D003198:Computer Simulation; D003627:Data Interpretation, Statistical; D015233:Models, Statistical