Affiliation:
1. Graduate School of Information Sciences, Tohoku University
Publisher
Institute of Electronics, Information and Communications Engineers (IEICE)
Subject
Artificial Intelligence,Electrical and Electronic Engineering,Computer Vision and Pattern Recognition,Hardware and Architecture,Software
Reference20 articles.
1. [1] M. Bonamy, M. Johnson, I. Lignos, V. Patel, and D. Paulusma, “Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs,” J. Combinatorial Optimization, vol.27, no.1, pp.132-143, 2014. 10.1007/s10878-012-9490-y
2. [2] M. Bonamy and N. Bousque, “Recoloring graphs via tree decompositions,” European Journal of Combinatorics, vol.69, pp.200-213, 2018. 10.1016/j.ejc.2017.10.010
3. [3] P. Bonsma and L. Cereceda, “Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances,” Theor. Comput. Sci., vol.410, no.50, pp.5215-5226, 2009. 10.1016/j.tcs.2009.08.023
4. [4] P. Bonsma, A.E. Mouawad, N. Nishimura, and V. Raman, “The complexity of bounded length graph recoloring and CSP reconfiguration,” Proc. IPEC 2014, Lect. Notes Comput. Sci., vol.8894, pp.110-121, 2014. 10.1007/978-3-319-13524-3_10
5. [5] P. Bonsma and D. Paulusma, “Using contracted solution graphs for solving reconfiguration problems,” Proc. MFCS 2016, LIPIcs 58, pp.20:1-20:15, 2016.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献