Title of article
The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs
Author/Authors
J?rgen Bang-Jensen ، نويسنده , , Anders Yeo، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
19
From page
1
To page
19
Keywords
Hamiltonian path , Hamiltonian cycle , Polynomial algorithm , locally semicomplete digraphs , path-mergeable digraph , multipartite tournament , semicomplete multipartite digraph , path covering , minimum equivalent digraph , cycle factor
Journal title
Journal of Algorithms
Serial Year
2001
Journal title
Journal of Algorithms
Record number
291472
Link To Document