Algorithmic applications of Baur-Strassen's theorem, shortest cycles, diameter, and matchings
From MaRDI portal
Publication:3177733
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Signed and weighted graphs (05C22) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Abstract: Consider a directed or an undirected graph with integral edge weights from the set [-W, W], that does not contain negative weight cycles. In this paper, we introduce a general framework for solving problems on such graphs using matrix multiplication. The framework is based on the usage of Baur-Strassen's theorem and of Strojohann's determinant algorithm. It allows us to give new and simple solutions to the following problems: * Finding Shortest Cycles -- We give a simple ilde{O}(Wn^{omega}) time algorithm for finding shortest cycles in undirected and directed graphs. For directed graphs (and undirected graphs with non-negative weights) this matches the time bounds obtained in 2011 by Roditty and Vassilevska-Williams. On the other hand, no algorithm working in ilde{O}(Wn^{omega}) time was previously known for undirected graphs with negative weights. Furthermore our algorithm for a given directed or undirected graph detects whether it contains a negative weight cycle within the same running time. * Computing Diameter and Radius -- We give a simple ilde{O}(Wn^{omega}) time algorithm for computing a diameter and radius of an undirected or directed graphs. To the best of our knowledge no algorithm with this running time was known for undirected graphs with negative weights. * Finding Minimum Weight Perfect Matchings -- We present an ilde{O}(Wn^{omega}) time algorithm for finding minimum weight perfect matchings in undirected graphs. This resolves an open problem posted by Sankowski in 2006, who presented such an algorithm but only in the case of bipartite graphs. In order to solve minimum weight perfect matching problem we develop a novel combinatorial interpretation of the dual solution which sheds new light on this problem. Such a combinatorial interpretation was not know previously, and is of independent interest.
Recommendations
Cited in
(11)- NC algorithms for weighted planar perfect matching and related problems
- Temporal matching on geometric graph data
- Two dimensional maximum weight matching using Manhattan topology
- Improved time bounds for all pairs non-decreasing paths in general digraphs
- Improved distance queries and cycle counting by Frobenius normal form
- Temporal matching
- A combinatoric interpretation of dual variables for weighted matching and \(f\)-factors
- Algorithms for weighted matching generalizations. I: Bipartite graphs, \(b\)-matching, and unweighted \(f\)-factors
- Toward Tight Approximation Bounds for Graph Diameter and Eccentricities
- Minimum cuts and shortest cycles in directed planar graphs via noncrossing shortest paths
- Algebraic and computer-based methods in the undirected degree/diameter problem - A brief survey
This page was built for publication: Algorithmic applications of Baur-Strassen's theorem, shortest cycles, diameter, and matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3177733)
