#3-Regular Bipartite Planar Vertex Cover is #P-Complete.

Mingji Xia Wenbo Zhao

Published in: TAMC (2006)

Keyphrases

vertex cover
planar graphs
approximation algorithms
undirected graph
partial order
bipartite graph
optimality criterion
social networks
theoretical analysis
partially ordered
minimum weight
polynomial time approximation