Zoekresultaten
Resultaat 1 - 20 (van 20)
T. Kloks K1,3-free and W4-free graphs
Non-fictie
Engels | 10 pagina's | Eindhoven University of Technology, Department of Mathematics and Computing Science, Computing Science Section, Eindhoven | 1994
Gedrukt boek
H.J. Broersma | T. Kloks | R. Niedermeier Treewidth of gridgraphs, planar graphs, and graphs with bounded degree
Non-fictie
Engels | 4 pagina's | Vrije Universiteit, Amsterdam | 1999
Gedrukt boek
H.J. Broersma | E. Dahlhaus | T. Kloks Algorithms for the treewidth and minimum fill-in of HHD-free graphs
Non-fictie
Engels | 9 pagina's | Faculty of Applied Mathematics, University of Twente, Enschede | 1996
Gedrukt boek
A. Blokhuis | T. Kloks On the equivalence covering number of splitgraphs
Non-fictie
Engels | 1 pagina's | Eindhoven University of Technology, Department of Mathematics and Computing Science, Eindhoven | 1994
Gedrukt boek
T. Kloks | D. Kratsch Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph
Non-fictie
Engels | 6 pagina's | Eindhoven University of Technology, Department of Mathematics and Computing Science, Eindhoven | 1994
Gedrukt boek
T. Kloks | D. Kratsch | H. Müller Dominoes
Non-fictie
Engels | 16 pagina's | Eindhoven University of Technology, Department of Mathematics and Computing Science, Computing Science Section, Eindhoven | 1994
Gedrukt boek
T. Kloks | D. Kratsch | H. Müller Listing simplicial vertices and recognizing diamond-free graphs
Non-fictie
Engels | 9 pagina's | Eindhoven University of Technology, Department of Mathematics and Computing Science, Eindhoven | 1994
Gedrukt boek
T. Kloks | D. Kratsch Finding all minimal separators of a graph
Non-fictie
Engels | Eindhoven University of Technology, Department of Mathematics and Computing Science, Computing Science Section, Eindhoven | 1993
Gedrukt boek
T. Kloks Treewidth
Non-fictie
Engels | 183 pagina's | Universiteit Utrecht, Faculteit Wiskunde en Informatica, Utrecht | 1993
Gedrukt boek
T. Kloks | D. Kratsch | J. Spinrad Treewidth and pathwidth of cocomparability graphs of bounded dimension
Non-fictie
Engels | Eindhoven University of Technology, Department of Mathematics and Computing Science, Computing Science Section, Eindhoven | 1993
Gedrukt boek
T. Kloks | D. Kratsch Treewidth of chordal bipartite graphs
Non-fictie
Engels | 15 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 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
T. Kloks | R.B. Tan Bandwidth and topological bandwidth of graphs with few P4S
Non-fictie
Engels | 17 pagina's | Vrije Universiteit, Amsterdam | 1998
Gedrukt boek
T. Kloks | D. Kratsch | H. Müller Asteroidal sets in graphs
Non-fictie
Engels | 13 pagina's | University of Twente, Faculty of Applied Mathematics, Enschede | 1996
Gedrukt boek
T. Kloks Minimum fill-in for chordal bipartite graphs
Non-fictie
Engels | 10 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1993
Gedrukt boek
T. Kloks Treewidth of circle graphs
Non-fictie
Engels | 10 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1993
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
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