FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2151827175> ?p ?o ?g. }

• W2151827175 endingPage "30" @default.
• W2151827175 startingPage "1" @default.
• W2151827175 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 article, 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 Õ ( Wnω ) time algorithm for finding shortest cycles in undirected and directed graphs. For directed graphs (and undirected graphs with nonnegative weights), this matches the time bounds obtained in 2011 by Roditty and Williams. On the other hand, no algorithm working in Õ ( Wn ω ) 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 Õ ( Wnω ) 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 Õ ( Wnω ) time algorithm for finding minimum-weight perfect matchings in undirected graphs. This resolves an open problem posted by Sankowski [2009] who presented such an algorithm but only in the case of bipartite graphs. These three problems that are solved in the full generality demonstrate the utility of this framework. Hence, we believe that it can find applications for solving larger spectra of related problems. As an illustrative example, we apply it to the problem of computing a set of vertices that lie on cycles of length at most t , for some given t . We give a simple Õ ( Wnω ) time algorithm for this problem that improves over the Õ ( Wnωt ) time algorithm given by Yuster in 2011. Besides giving this flexible framework, the other main contribution of this article is the development of a novel combinatorial interpretation of the dual solution for the minimum-weight perfect matching problem. Despite the long history of the matching problem, such a combinatorial interpretation was not known previously. This result sheds a new light on the problem, as there exist many structural theorems about unweighted matchings, but almost no results that could cope with the weighted case." @default.
• W2151827175 created "2016-06-24" @default.
• W2151827175 creator A5001013961 @default.
• W2151827175 creator A5025494465 @default.
• W2151827175 creator A5037989463 @default.
• W2151827175 date "2015-09-11" @default.
• W2151827175 modified "2023-09-30" @default.
• W2151827175 title "Algorithmic Applications of Baur-Strassen’s Theorem" @default.
• W2151827175 cites W1494735819 @default.
• W2151827175 cites W1509653541 @default.
• W2151827175 cites W1969573308 @default.
• W2151827175 cites W1973342538 @default.
• W2151827175 cites W1994613175 @default.
• W2151827175 cites W1995653528 @default.
• W2151827175 cites W1999848117 @default.
• W2151827175 cites W2008816808 @default.
• W2151827175 cites W2022980325 @default.
• W2151827175 cites W2040326319 @default.
• W2151827175 cites W2041786457 @default.
• W2151827175 cites W2045859197 @default.
• W2151827175 cites W2049500052 @default.
• W2151827175 cites W2050358029 @default.
• W2151827175 cites W2066470474 @default.
• W2151827175 cites W2071406157 @default.
• W2151827175 cites W2080132708 @default.
• W2151827175 cites W2090168101 @default.
• W2151827175 cites W2091299439 @default.
• W2151827175 cites W2123452111 @default.
• W2151827175 cites W2124852572 @default.
• W2151827175 cites W2136442765 @default.
• W2151827175 cites W2137572956 @default.
• W2151827175 cites W2151732151 @default.
• W2151827175 cites W2152290683 @default.
• W2151827175 cites W2155061423 @default.
• W2151827175 cites W2166645359 @default.
• W2151827175 cites W2327315803 @default.
• W2151827175 cites W2610729871 @default.
• W2151827175 doi "https://doi.org/10.1145/2736283" @default.
• W2151827175 hasPublicationYear "2015" @default.
• W2151827175 type Work @default.
• W2151827175 sameAs 2151827175 @default.
• W2151827175 citedByCount "37" @default.
• W2151827175 countsByYear W21518271752012 @default.
• W2151827175 countsByYear W21518271752013 @default.
• W2151827175 countsByYear W21518271752014 @default.
• W2151827175 countsByYear W21518271752015 @default.
• W2151827175 countsByYear W21518271752016 @default.
• W2151827175 countsByYear W21518271752017 @default.
• W2151827175 countsByYear W21518271752018 @default.
• W2151827175 countsByYear W21518271752019 @default.
• W2151827175 countsByYear W21518271752020 @default.
• W2151827175 countsByYear W21518271752021 @default.
• W2151827175 countsByYear W21518271752022 @default.
• W2151827175 countsByYear W21518271752023 @default.
• W2151827175 crossrefType "journal-article" @default.
• W2151827175 hasAuthorship W2151827175A5001013961 @default.
• W2151827175 hasAuthorship W2151827175A5025494465 @default.
• W2151827175 hasAuthorship W2151827175A5037989463 @default.
• W2151827175 hasConcept C100107663 @default.
• W2151827175 hasConcept C111472728 @default.
• W2151827175 hasConcept C114614502 @default.
• W2151827175 hasConcept C118615104 @default.
• W2151827175 hasConcept C132525143 @default.
• W2151827175 hasConcept C138885662 @default.
• W2151827175 hasConcept C146380142 @default.
• W2151827175 hasConcept C197657726 @default.
• W2151827175 hasConcept C203776342 @default.
• W2151827175 hasConcept C2780586882 @default.
• W2151827175 hasConcept C3018234147 @default.
• W2151827175 hasConcept C33923547 @default.
• W2151827175 hasConcept C43517604 @default.
• W2151827175 hasConceptScore W2151827175C100107663 @default.
• W2151827175 hasConceptScore W2151827175C111472728 @default.
• W2151827175 hasConceptScore W2151827175C114614502 @default.
• W2151827175 hasConceptScore W2151827175C118615104 @default.
• W2151827175 hasConceptScore W2151827175C132525143 @default.
• W2151827175 hasConceptScore W2151827175C138885662 @default.
• W2151827175 hasConceptScore W2151827175C146380142 @default.
• W2151827175 hasConceptScore W2151827175C197657726 @default.
• W2151827175 hasConceptScore W2151827175C203776342 @default.
• W2151827175 hasConceptScore W2151827175C2780586882 @default.
• W2151827175 hasConceptScore W2151827175C3018234147 @default.
• W2151827175 hasConceptScore W2151827175C33923547 @default.
• W2151827175 hasConceptScore W2151827175C43517604 @default.
• W2151827175 hasFunder F4320321042 @default.
• W2151827175 hasFunder F4320334678 @default.
• W2151827175 hasIssue "4" @default.
• W2151827175 hasLocation W21518271751 @default.
• W2151827175 hasOpenAccess W2151827175 @default.
• W2151827175 hasPrimaryLocation W21518271751 @default.
• W2151827175 hasRelatedWork W1725047827 @default.
• W2151827175 hasRelatedWork W1977037817 @default.
• W2151827175 hasRelatedWork W1993546945 @default.
• W2151827175 hasRelatedWork W1996072328 @default.
• W2151827175 hasRelatedWork W2061687898 @default.
• W2151827175 hasRelatedWork W2184121962 @default.
• W2151827175 hasRelatedWork W2748469983 @default.
• W2151827175 hasRelatedWork W2796019246 @default.

• next