- Maximum Flow and Minimum-Cost Flow in Almost-Linear Time
2022/03/01 by Li Chen, Rasmus Kyng, Chen, Li +9 · 4 voices · 67 citations
Computer Science · Mathematics · #Amortized analysis #Bounded function #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Data structure #Discrete mathematics #Flow (mathematics) #Flow network #Markov Chains and Monte Carlo Methods #Mathematical optimization #Mathematics #Maximum flow problem #Minimum cut #Minimum-cost flow problem #Optimization and Search Problems #Regular polygon #Scaling #Separable space #Time complexity #cs.DS
- Finding a minimum feedback arc set in reducible flow graphs
1988/09/01 by Vijaya Ramachandran · 4 citations
Computer Science · Mathematics · #1-planar graph #Advanced Graph Theory Research #Algorithm #Chordal graph #Combinatorics #Complexity and Algorithms in Graphs #Control flow graph #Feedback arc set #Feedback vertex set #Flow (mathematics) #Flow network #Graph #Interconnection Networks and Systems #Line graph #Mathematics #Maximal independent set #Maximum flow problem #Minimum cut #Time complexity #Vertex (graph theory)
- Finding a Minimum Circuit in a Graph
1978/11/01 by Alon Itai, Michael Rodeh · 7 citations
Computer Science · Mathematics · #Computational Geometry and Mesh Generation #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Combinatorics #Mathematics #Graph #Electronic circuit #Binary logarithm #Discrete mathematics #Graph theory #Minimum cut #Minimum weight #Algorithm