Zoekresultaten
Resultaat 1 - 8 (van 8)
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 | 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
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 | 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