Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs.

Samir Datta Raghav Kulkarni Sambuddha Roy

Published in: Theory Comput. Syst. (2010)

Keyphrases

planar graphs
matching algorithm
bipartite graph
graph model
undirected graph
np hard
model selection