Welcome to Christophe Paul's home pageHome | Research | Publications | Teaching | VitaeUE 345 Master
informatique (Univ. Montpellier 2)
COMP 560 (SoCS,
McGill): Graph algorithms and applications
The material avalaible here is just drafts, which are incomplete, but used as a basis of my lectures. COMP 560 (SoCS, McGill): Graph algorithms and applications
Bibliographie :
D. Lokshtanov, S. Saurabh. Kernel: lower and upper bounds.
H. Bodlaender, R. Downey, M. Fellows, D. Hermelin. On problems without polynomial kernels. ICALP (1) 2008: 563-574.
H. Bodlaender, S. Thomassé, A. Yeo. Kernel Bounds for Disjoint Cycles and Disjoint Paths. ESA 2009: 635-646. M. Dom, D. Lokshtanov, S. Saurabh. Incompressibility through Colors and IDs. ICALP (1) 2009: 378-389. J. Chen, J. Meng. On Parameterized Intractability: Hardness and Completeness. Comput. J. 51(1): 39-59 (2008)
Bibliographie :
M. Habib, C. Paul. A survey on modular aspects of modular decomposition. (version de travail)
E. Gioan, C. Paul. Split decomposition and graph-labelled trees... CoRR abs/0810.1823: (2008)
|