The most vital edges of matching in a bipartite graph

DOI10.1002/NET.3230230413MaRDI QIDQ5289375zbMATH OpenOpenAlexFDO

Authors Chun-Nan Hung, Lih-Hsing Hsu, Ting-Yi Sung

Publication date 23 August 1993

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230230413

zbMATH Keywords

undirected graphmaximum weighted matchingmost vital edge

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Optimum matchings in weighted bipartite graphs
• Parallel algorithm for finding the most vital edge in weighted graphs
• Parallel algorithms for finding the most vital edge with respect to minimum spanning tree
• scientific article; zbMATH DE number 1104338

Cites work

• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• Graph theory with applications

Cited in

(1)

• Element perturbation problems of optimum spanning trees with two-parameter objectives

This page was built for publication: The most vital edges of matching in a bipartite graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5289375)