Author:
Duarte Abraham,Escudero Laureano F.,Martí Rafael,Mladenovic Nenad,Pantrigo Juan José,Sánchez-Oro Jesús
Funder
the Spanish Ministry of Science and Innovation
the Government of the Community of Madrid
Subject
Management Science and Operations Research,Modeling and Simulation,General Computer Science
Reference34 articles.
1. Bodlaender HL, Möhring RH. The pathwidth and treewidth of cographs. In: Proceedings of the second Scandinavian workshop on algorithm theory, SWAT'90; 1990. p. 301–9.
2. Treewidth and pathwidth of permutation graphs;Bodlaender;SIAM Journal of Discrete Mathematics,1995
3. Approximating treewidth, pathwidth, frontsize, and shortest elimination tree;Bodlaender;Journal of Algorithms,1995
4. Bodlaender HL, Gustedt J, Telle JA. Linear-time register allocation for a fixed number of registers. In: Proceedings of the symposium on discrete algorithms; 1998. p. 574–3.
5. Edge-isoperimetric inequalities in the grid;Bollobás;Combinatorica,1991
Cited by
47 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献