@inproceedings{1b4f9612c2734b5d9794fe5d7f317105,

title = "All-cavity maximum matchings",

abstract = "Let G = (X, Y, E) be a bipartite graph with integer weights on the edges. Let n, m, and N denote the vertex count, the edge count, and an upper bound on the absolute values of edge weights of G, respectively. For a vertex u in G, let Gu denote the graph formed by deleting u from G. The all-cavity maximum matching problem asks for a maximum weight matching in Gu for all u in G. This problem finds applications in optimal tree algorithms for computational biology. We show that the problem is solvable in. (formula presented) time, matching the currently best time complexity for merely computing a single maximum weight matching in G. We also give an algorithm for a generalization of the problem where both a vertex from X and one from Y can be deleted. The running time is (formula presented). Our algorithms are based on novel linear-time reductions among problems of computing shortest paths and all-cavity maximum matchings.",

author = "Kao, {Ming Yang} and Lam, {Tak Wah} and Sung, {Wing Kin} and Ting, {Hing Fung}",

year = "1997",

month = jan,

day = "1",

doi = "10.1007/3-540-63890-3_39",

language = "English (US)",

isbn = "3540638903",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "364--373",

editor = "Leong, {Hon Wai} and Sanjay Jain and Hiroshi Imai",

booktitle = "Algorithms and Computation - 8th International Symposium, ISAAC 1997, Proceedings",

address = "Germany",

note = "8th Annual International Symposium on Algorithms and Computation, ISAAC 1997 ; Conference date: 17-12-1997 Through 19-12-1997",

}