 |
Fakultät für Informatik - Technische Universität MünchenLehrstuhl für Effiziente Algorithmen |
 |
Die bibliographische Datenbank LEABib
Suchen •
Liste der Journale •
Liste der Serien •
Liste der Konferenzen •
Ausgewählte Publikationen 
|
Hilfe 
|
 |
|
| Suche: Citkey="Bang-Jensen-Huang-Yeo/03" |
|
Strongly connected spanning subdigraphs with the minimum number of arcs in quasi-transitive digraphs
Jrgen Bang-Jensen, Jing Huang, Anders Yeo
SIAM Journal on Discrete Mathematics 16 (2), 2003, pp. 335-343
| Editors | J.R. Griggs | |
| Publisher: | Society for Industrial and Applied Mathematics | |
| Address: | Philadelphia, PA | |
| Keywords: | minimum equivalent digraph, strong subdigraph, hamiltonian cycle, polynomial algorithm, quasi-transitive digraph, extended semicomplete digraph, path factor, cycle factor, path cover, longest cycle | |
| URL: |
http://dx.doi.org/10.1137/S0895480199354220 | |
|
|
|
|