Zoekresultaten
Resultaat 21 - 33 (van 33)
Hans L. Bodlaender A tourist guide through treewidth
Non-fictie
Engels | 18 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1992
Gedrukt boek
T. Kloks | Hans L. Bodlaender Approximating treewidth and pathwidth of some classes of perfect graphs
Non-fictie
Engels | 19 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1992
Gedrukt boek
T. Kloks | Hans L. Bodlaender On the treewidth and pathwidth of permutation graphs
Non-fictie
Engels | 9 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1992
Gedrukt boek
T. Kloks | Hans L. Bodlaender Only few graphs have bounded treewidth
Non-fictie
Engels | 13 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1992
Gedrukt boek
Hans L. Bodlaender | T. Kloks | D. Kratsch Treewidth and pathwidth of permutation graphs
Non-fictie
Engels | 16 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1992
Gedrukt boek
Hans L. Bodlaender | T. Kloks Fast algorithms for the Tron game on trees
Non-fictie
Engels | 17 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1990
Gedrukt boek
A. Koster | Hans L. Bodlaender | Stan van Hoesel Treewidth: computational experiments
Non-fictie
Engels | 24 pagina's | METEOR, Maastricht research school of Economics of Technology and Organizations, Maastricht | 2002
Gedrukt boek
Goos Kant | Hans L. Bodlaender Triangulating planar graphs while minimizing the maximum degree
Non-fictie
Engels | 24 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1992
Gedrukt boek
T. Kloks | Hans L. Bodlaender Testing superperfection of k-trees
Non-fictie
Engels | 15 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1992
Gedrukt boek
Goos Kant | Hans L. Bodlaender Planar graph augmentation problems
Non-fictie
Engels | 31 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1991
Gedrukt boek
Linda van der Gaag | Hans L. Bodlaender Comparing loop cutsets and clique trees in probabilistic inference
Non-fictie
Engels | 5 pagina's | Universiteit Utrecht, Utrecht | 1997
Gedrukt boek
Hans L. Bodlaender | T. Kloks Efficient and constructive algorithms for the pathwidth and treewidth of graphs
Non-fictie
Engels | 40 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1993
Gedrukt boek
Hans L. Bodlaender | Michael R. Fellows | Tandy J. Warnow Two strikes against perfect phylogeny
Non-fictie
Engels | 17 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1992
Gedrukt boek