The most vital edges of matching in a bipartite graph

DOI10.1002/net.3230230413zbMath0778.90078OpenAlexW2097674030MaRDI QIDQ5289375

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

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) Abstract computational complexity for mathematical programming problems (90C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item

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