Abstract
As a generalization of paths, the notion of paths of bandwidth w is introduced. We show that, for constant w ≥ 1, the corresponding search problem for such a path of length k in a given graph is NP-complete and fixed-parameter tractable (FPT) in the parameter k, like this is known for the special case w = 1, the LONGEST PATH problem. We state the FPT algorithm in terms of a guess and check protocol which uses witnesses of size polynomial in the parameter.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alon, N., Yuster, R., Zwick, U.: Color-Coding. J. ACM 42(4), 844–856 (1995)
Cai, L., Chen, J., Downey, R.G., Fellows, M.R.: On the Structure of Parameterized Problems in NP. Inf. Comput. 123(1), 38–49 (1995)
Downey, R.G., Fellows, M.R.: Fixed-Parameter Intractability. In: Structure in Complexity Theory Conference, pp. 36–49 (1992)
Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, New York (1979)
Monien, B.: How to Find Long Paths Efficiently. Annals of Discrete Mathematics 25, 239–254 (1985)
Proskurowski, A., Telle, J.A.: Classes of Graphs with Restricted Interval Models. Discrete Mathematics & Theoretical Computer Science 3(4), 167–176 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Borchert, B., Reinhardt, K. (2006). Searching Paths of Constant Bandwidth. In: Wiedermann, J., Tel, G., Pokorný, J., Bieliková, M., Štuller, J. (eds) SOFSEM 2006: Theory and Practice of Computer Science. SOFSEM 2006. Lecture Notes in Computer Science, vol 3831. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11611257_16
Download citation
DOI: https://doi.org/10.1007/11611257_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31198-0
Online ISBN: 978-3-540-32217-7
eBook Packages: Computer ScienceComputer Science (R0)