A Fast Dynamic Opti mum Algorithmfor Maxi mum Matching in Bipartite Graphs
Zhai Jin-gang · Ludong University Journal · 2006
Establishing a matchingrule in order of precedence of twolevel in Bipartite Graphs,Underthe rule,mak-ing use of improved Depth-First Searchto mendthe matching algorithm,thus the mended algorithmis able to adjustperformance of self accordingtothe number of connected componentin Bipartite Graphs,whosetime complexityisO(max(|V|,|E|,m|U|).