Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference29 articles.
1. Dynamic programming on graphs with bounded treewidth;Bodlaender,1988
2. Recoloring bounded treewidth graphs;Bonamy;Electron. Notes Discrete Math.,2013
3. Rerouting shortest paths in planar graphs;Bonsma,2012
4. The complexity of rerouting shortest paths;Bonsma;Theoret. Comput. Sci.,2013
5. P. Bonsma, Independent set reconfiguration in cographs and their generalizations, J. Graph Theory, http://dx.doi.org/10.1002/jgt.21992.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献