English
Català
Čeština
Deutsch
Español
Français
Gàidhlig
Latviešu
Magyar
Nederlands
Polski
Português
Português do Brasil
Suomi
Svenska
Türkçe
Қазақ
বাংলা
हिंदी
Ελληνικά
Yкраї́нська
Log In
Email address
Password
Log in
Communities & Collections
All of MSpace
Statistics
English
Català
Čeština
Deutsch
Español
Français
Gàidhlig
Latviešu
Magyar
Nederlands
Polski
Português
Português do Brasil
Suomi
Svenska
Türkçe
Қазақ
বাংলা
हिंदी
Ελληνικά
Yкраї́нська
Log In
Email address
Password
Log in
Home
Faculty of Graduate Studies (Electronic Theses and Practica)
FGS - Electronic Theses and Practica
Complexity and approximation algorithms for the Maximum Leaf Spanning Tree Problem and its variations
Complexity and approximation algorithms for the Maximum Leaf Spanning Tree Problem and its variations
Loading...
Files
Zhou_Complexity_and.pdf
(6.6 MB)
Date
2007
Authors
Zhou, Yijie
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Description
Keywords
Citation
URI
http://hdl.handle.net/1993/20980
Collections
FGS - Electronic Theses and Practica
Full item page