Shortest alternating path algorithms

DOI10.1002/NET.3230040404MaRDI QIDQ4079339zbMATH OpenOpenAlexFDO

Authors

Publication date 1974

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230040404

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35)

Cites work

• Paths, Trees, and Flowers

Cited in

(1)

• Algorithms for finding k-best perfect matchings

This page was built for publication: Shortest alternating path algorithms

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