Author:
Kozawa Kyohei,Otachi Yota,Yamazaki Koichi
Funder
JSPS Research Fellowship for Young Scientists
KAKENHI
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference24 articles.
1. Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties;Ausiello,1999
2. P. Austrin, T. Pitassi, Y. Wu, Inapproximability of treewidth, one-shot pebbling, and related layout problems, in: APPROX-RANDOM, 2012, pp. 13–24.
3. A partial k-arboretum of graphs with bounded treewidth;Bodlaender;Theoret. Comput. Sci.,1998
4. Approximating treewidth, pathwidth, frontsize, and shortest elimination tree;Bodlaender;J. Algorithms,1995
5. Treewidth lower bounds with brambles;Bodlaender;Algorithmica,2008
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Structural properties of graph products;Journal of Graph Theory;2023-08-09
2. On Strict Brambles;Graphs and Combinatorics;2023-02-19
3. On the treewidth of Hanoi graphs;Theoretical Computer Science;2022-03
4. Planar Graphs Have Bounded Queue-Number;Journal of the ACM;2020-08-13
5. On the treewidth of toroidal grids;Discrete Applied Mathematics;2016-01