Exact Algorithms for Bandwidth
Publisher
Springer New York
Reference8 articles.
1. Bodlaender HL, Fellows MR, Hallett MT (1994) Beyond np-completeness for problems of bounded width: hardness for the W hierarchy. In: Leighton FT, Goodrich MT (eds) Proceedings of the twenty-sixth annual ACM symposium on theory of computing, Montréal, 23–25 May 1994. ACM, pp 449–458, doi:10.1145/195058.195229.
http://doi.acm.org/10.1145/195058.195229
2. Cygan M, Pilipczuk M (2008) Faster exact bandwidth. In: Broersma H, Erlebach T, Friedetzky T, Paulusma D (eds) Graph-theoretic concepts in computer science, 34th international workshop, WG 2008, Durham, June 30–July 2, 2008. Revised papers, Lecture notes in computer science, vol 5344, pp 101–109. doi:10.1007/978-3-540-92248-3_10.
http://dx.doi.org/10.1007/978-3-540-92248-3_10
3. Cygan M, Pilipczuk M (2010) Exact and approximate bandwidth. Theor Comput Sci 411(40–42):3701–3713. doi:10.1016/j.tcs.2010.06.018.
http://dx.doi.org/10.1016/j.tcs.2010.06.018
4. Cygan M, Pilipczuk M (2012) Bandwidth and distortion revisited. Discret Appl Math 160(4–5):494–504. doi:10.1016/j.dam.2011.10.032.
http://dx.doi.org/10.1016/j.dam.2011.10.032
5. Cygan M, Pilipczuk M (2012) Even faster exact bandwidth. ACM Trans Algorithms 8(1):8. doi:10.1145/2071379.2071387.
http://doi.acm.org/10.1145/2071379.2071387