"The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration."

Paul S. Bonsma et al. (2014)

> Home

Details and statistics

DOI: 10.1007/978-3-319-13524-3_10

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/iwpec/BonsmaMNR14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iwpec/BonsmaMNR14
Paul S. Bonsma, Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman:
The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration. IPEC 2014: 110-121

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.