Path problems in skew-symmetric graphs

1996/09/01 by Andrew V. Goldberg, Alexander V. Karzanov · 24 citations
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Discrete mathematics #Graph #Longest path problem #Mathematics #Path (computing) #Reachability #Shortest path problem #Skew #Vehicle Routing Optimization Methods

paper · doi:10.1007/bf01261321

published in Combinatorica 16(3), 353-382 (Springer Science and Business Media LLC)

crossref issued 1996/09/01 · crossref published 1996/09/01 · crossref published-print 1996/09/01 · openalex publication_date 1996/09/01 · crossref created 2005/03/23 · crossref deposited 2020/04/06 · openalex created_date 2025/10/10 · crossref indexed 2026/06/13 · openalex updated_date 2026/06/19

Citations

• The Factorization of Linear Graphs
• A linear-time algorithm for a special case of disjoint set union
• Fibonacci heaps and their uses in improved network optimization algorithms
• A note on two problems in connexion with graphs
• Paths, Trees, and Flowers

Cited by

• Maximum skew-symmetric flows and matchings
• Acyclic Bidirected and Skew-Symmetric Graphs: Algorithms and Structure
• Claw-free graph [wikipedia]
• Skew-symmetric graph [wikipedia]