Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs

Author: Datta Samir  

Publisher: Springer Publishing Company

ISSN: 1432-4350

Source: Theory of Computing Systems, Vol.47, Iss.3, 2010-10, pp. : 737-757

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract