Skip to main content
SpringerLink
Log in

Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

The Minimum Eccentricity Shortest Path Problem consists in finding a shortest path with minimum eccentricity in a given undirected graph. The problem is known to be NP-complete and W[2]-hard with respect to the desired eccentricity. We present fpt-algorithms for the problem parameterized by the modular width, distance to cluster graph, the combination of treewidth with the desired eccentricity, and maximum leaf number.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Dragan, F.F., Leitert, A.: On the minimum eccentricity shortest path problem. In: Dehne, F., Sack, J.-R., Stege, U. (eds.) Algorithms and Data Structures, pp. 276–288. Springer, Cham (2015)

    Chapter  Google Scholar 

  2. Völkel, F., Bapteste, E., Habib, M., Lopez, P., Vigliotti, C.: Read networks and k-laminar graphs. CoRR abs/1603.01179 (2016) arXiv:1603.01179

  3. Tenenbaum, J.B., Silva, V.d., Langford, J.C.: A global geometric framework for nonlinear dimensionality reduction. Science 290 (5500), 2319–2323 (2000) https://science.sciencemag.org/content/290/5500/2319.full.pdf

  4. Indyk, P.: Algorithmic applications of low-distortion geometric embeddings. In: FOCS 2001, pp. 10–33. IEEE Computer Society, Newport Beach, CA, USA (2001)

  5. Indyk, P., Matousek, J.: Low-distortion embeddings of finite metric spaces. In: Handbook of Discrete and Computational Geometry, pp. 177–196. CRC, New York (2004)

  6. Birmelé, É., de Montgolfier, F., Planche, L.: Minimum eccentricity shortest path problem: An approximation algorithm and relation with the k-laminarity problem. In: Chan, T.-H.H., Li, M., Wang, L. (eds.) Combinatorial Optimization and Applications, pp. 216–229. Springer, Cham (2016)

    Chapter  MATH  Google Scholar 

  7. Dragan, F.F., Leitert, A.: Minimum eccentricity shortest paths in some structured graph classes. J. Graph Algorithms Appl. 20(2), 299–322 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  8. Dragan, F.F., Leitert, A.: On the minimum eccentricity shortest path problem. Theor. Comput. Sci. 694, 66–78 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  9. Birmelé, E., de Montgolfier, F., Planche, L., Viennot, L.: Decomposing a graph into shortest paths with bounded eccentricity. Discret. Appl. Math. 284, 353–374 (2020)

    Article  MathSciNet  MATH  Google Scholar 

  10. Birmelé, E., de Montgolfier, F., Planche, L., Viennot, L.: Decomposing a Graph into Shortest Paths with Bounded Eccentricity. In: Okamoto, Y., Tokuyama, T. (eds.) 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), vol. 92, pp. 15–11513. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2017). https://doi.org/10.4230/LIPIcs.ISAAC.2017.15. http://drops.dagstuhl.de/opus/volltexte/2017/8262

  11. Sorge, M., Weller, M.: The Graph Parameter Hierarchy (2016). https://manyu.pro/assets/parameter-hierarchy.pdf

  12. Diestel, R.: Graph Theory, 5th Edition. Graduate texts in mathematics, vol. 173. Springer, Berlin, Heidelberg (2016)

  13. Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Cham (2015)

    Book  MATH  Google Scholar 

  14. Gajarský, J., Lampis, M., Ordyniak, S.: Parameterized algorithms for modular-width. In: Gutin, G., Szeider, S. (eds.) Parameterized and Exact Computation, pp. 163–176. Springer, Cham (2013)

    Chapter  MATH  Google Scholar 

  15. Tedder, M., Corneil, D., Habib, M., Paul, C.: Simpler linear-time modular decomposition via recursive factorizing permutations. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) Automata, Languages and Programming, pp. 634–645. Springer, Berlin, Heidelberg (2008)

    Chapter  Google Scholar 

  16. Boral, A., Cygan, M., Kociumaka, T., Pilipczuk, M.: A fast branching algorithm for cluster vertex deletion. Theory Comput. Syst. 58(2), 357–376 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  17. Courcelle, B.: The monadic second-order logic of graphs. i. recognizable sets of finite graphs. Inf. Comput. 85(1), 12–75 (1990). https://doi.org/10.1016/0890-5401(90)90043-H

    Article  MathSciNet  MATH  Google Scholar 

  18. Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12(2), 308–340 (1991). https://doi.org/10.1016/0196-6774(91)90006-K

    Article  MathSciNet  MATH  Google Scholar 

  19. Bouland, A.M.: Parameterized complexity and graph isomorphism. Master’s thesis, University of Cambridge (2011)

Download references

Acknowledgements

The authors would like to express their thanks to Dr. Dušan Knop for fruitful discussions concerning the problem that in particular led to the discovery of the treewidth algorithm, and to Tung Anh Vu for naming the Constrained Set Cover problem. The work of Martin Kučera was supported by the Student Summer Research Program 2020 of FIT CTU in Prague, and by grant SGS20/212/OHK3/3T/18. Ondřej Suchý acknowledges the support of the OP VVV MEYS funded project CZ.02.1.01/0.0/0.0/16_019/0000765 “Research Center for Informatics”.

Author information

Authors and Affiliations

  1. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, Thákurova 9, Prague, 160 00, Czech Republic

    Martin Kučera & Ondřej Suchý

Authors
  1. Martin Kučera
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ondřej Suchý
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Martin Kučera.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kučera, M., Suchý, O. Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters. Algorithmica 85, 762–782 (2023). https://doi.org/10.1007/s00453-022-01006-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-022-01006-x

Keywords

Search

Navigation