Finding Cheapest Cycles in Vertex-weighted Quasi-transitive and Extended Semicomplete Digraphs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo. Finding Cheapest Cycles in Vertex-weighted Quasi-transitive and Extended Semicomplete Digraphs. In Hajo Broersma, Matthew Johnson 0002, Stefan Szeider, editors, Algorithms and Complexity in Durham 2005 - Proceedings of the First ACiD Workshop, 8-10 July 2005, Durham, UK. Volume 4 of Texts in Algorithmics, pages 81-94, King s College, London, 2005.

This author has not been identified. Look up 'Jørgen Bang-Jensen' in GoogleThis author has not been identified. Look up 'Gregory Gutin' in GoogleThis author has not been identified. Look up 'Anders Yeo' in Google

runs on WebDSL