An efficient Dijkstra-like labeling method for computing shortest odd/even paths
From MaRDI portal
Publication:1072571
DOI10.1016/0020-0190(85)90094-8zbMath0587.05043OpenAlexW2054051522MaRDI QIDQ1072571
Publication date: 1985
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(85)90094-8
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Alternate strategies for solving bottleneck assignment problems - analysis and computational results
- Weakly bipartite graphs and the max-cut problem
- An analysis of alternative strategies for implementing matching algorithms
- A shortest augmenting path method for solving minimal perfect matching problems
- Maximum matching and a polyhedron with 0,1-vertices