Maximum skew-symmetric flows

DOI10.1007/3-540-60313-1_141zbMATH Open1512.90236MaRDI QIDQ6102298FDOQ6102298

Authors: Andrew V. Goldberg, Alexander V. Karzanov 

Publication date: 8 May 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Recommendations

• Maximum skew-symmetric flows and matchings
• On flows in simple bidirected and skew-symmetric networks
• scientific article; zbMATH DE number 1003285
• scientific article; zbMATH DE number 2094562
• scientific article; zbMATH DE number 1769330

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Deterministic network models in operations research (90B10) Flows in graphs (05C21)

Cites Work

• Title not available (Why is that?)
• Matching theory
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Paths, Trees, and Flowers
• Title not available (Why is that?)
• Faster scaling algorithms for general graph matching problems
• Title not available (Why is that?)
• Finding Minimum-Cost Circulations by Successive Approximation
• Self-adjusting binary search trees
• A new approach to the maximum-flow problem
• A Faster Deterministic Maximum Flow Algorithm
• Network Flow and Testing Graph Connectivity
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Improved Time Bounds for the Maximum Flow Problem

Cited In (5)

• Mutual exclusion scheduling with interval graphs or related classes. I
• Linear time parameterized algorithms via skew-symmetric multicuts
• Maximum skew-symmetric flows and matchings
• Efficient algorithms for maximum weight matchings in general graphs with small edge weights
• Making bidirected graphs strongly connected

This page was built for publication: Maximum skew-symmetric flows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6102298)