The Computational Complexity of Tutte Invariants for Planar Graphs.

Dirk L. Vertigan

Published in: SIAM J. Comput. (2005)

Keyphrases

planar graphs
computational complexity
minimum weight
special case
np complete
np hard
worst case
greedy heuristic
belief propagation
message passing