Efficient algorithms for some path partitioning problems
From MaRDI portal
Publication:1900138
DOI10.1016/0166-218X(94)00146-5zbMath0838.90101MaRDI QIDQ1900138
Publication date: 22 November 1995
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Dynamic programming (90C39)
Cites Work
This page was built for publication: Efficient algorithms for some path partitioning problems