Deciding whether a planar graph has a cubic subgraph is NP-complete.

Iain A. Stewart

Published in: Discret. Math. (1994)

Keyphrases

np complete
planar graphs
np hard
computational complexity
minimum weight
approximation algorithms
lower bound
binary variables
optimal solution
dynamic programming
special case
social networks
bipartite graph
weighted graph
approximate inference
greedy heuristic
partition function