Path problems in skew-symmetric graphs

DOI10.1007/BF01261321zbMath0867.05037OpenAlexW3136397722MaRDI QIDQ2563512

Andrew V. Goldberg, Alexander V. Karzanov

Publication date: 3 August 1997

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01261321

zbMATH Keywords

digraphdualitypath problemsefficient algorithmsgraph reachabilityshorgest pathskew-symmetric graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (11)

Shortest Paths in Nearly Conservative Digraphs ⋮ Min-cost multiflows in node-capacitated undirected networks ⋮ On flows in simple bidirected and skew-symmetric networks ⋮ Balanced network flows. VI. Polyhedral descriptions ⋮ Unnamed Item ⋮ Balanced network flows. VII. Primal-dual algorithms ⋮ Minimum mean cycle problem in bidirected and skew-symmetric graphs ⋮ Making bidirected graphs strongly connected ⋮ Faster graph bipartization ⋮ Switching Graphs ⋮ SWITCHING GRAPHS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• On paths avoding forbidden pairs of vertices in a graph
• A linear-time algorithm for a special case of disjoint set union
• Minimum cost multiflows in undirected networks
• On a routing problem
• TWO THEOREMS IN GRAPH THEORY
• Efficiency of a Good But Not Linear Set Union Algorithm
• Paths, Trees, and Flowers
• Maximum matching and a polyhedron with 0,1-vertices
• Antisymmetrical Digraphs
• The factorization of graphs. II
• The Factorization of Linear Graphs

This page was built for publication: Path problems in skew-symmetric graphs