The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs

J?rgen Bang-Jensen ، نويسنده , , Anders Yeo، نويسنده ,

روزنامه با شماره پیاپی سال 2001

19

1

19

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 of Algorithms

2001

Journal of Algorithms

291472