Abstract
This is a summary of the main results presented in the author’s PhD thesis. This thesis, written in English, was supervised by Frits Spieksma and defended on September 23, 2005 at the Katholieke Universiteit Leuven. A copy of the thesis is available from the authors website (http://www.econ. kuleuven.be/linda.moonen/public/). The thesis can be roughly split into two parts. The first part is dedicated to the problem of partitioning partially ordered sets into chains of limited size. The second part deals with the structure and the connectivity of the Internet.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Courcelle B, Engelfriet J, Rozenberg G (1993) Handle-rewriting hypergraph grammars. J Comput Syst Sci 46:218–270
Dilworth RP (1950) A decomposition theorem for partially ordered sets. Ann Math 51:161–166
Moonen LS, Spieksma FCR (2006) Exact algorithms for a loading problem with bounded clique width. INFORMS J Comput (to appear)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Moonen, L.S. Algorithms for some graph theoretical optimization problems. 4OR 4, 259–261 (2006). https://doi.org/10.1007/s10288-006-0010-8
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10288-006-0010-8