The parameterized complexity of finding minimum bounded chains

Article Properties
Cite
Blaser, Nello, et al. “The Parameterized Complexity of Finding Minimum Bounded Chains”. Computational Geometry, 2024, p. 102102, https://doi.org/10.1016/j.comgeo.2024.102102.
Blaser, N., Brun, M., Salbu, L. M., & Vågset, E. R. (2024). The parameterized complexity of finding minimum bounded chains. Computational Geometry, 102102. https://doi.org/10.1016/j.comgeo.2024.102102
Blaser, Nello, Morten Brun, Lars M. Salbu, and Erlend Raa Vågset. “The Parameterized Complexity of Finding Minimum Bounded Chains”. Computational Geometry, 2024, 102102. https://doi.org/10.1016/j.comgeo.2024.102102.
Blaser N, Brun M, Salbu LM, Vågset ER. The parameterized complexity of finding minimum bounded chains. Computational Geometry. 2024;:102102.
Journal Categories
Science
Mathematics
Technology
Engineering (General)
Civil engineering (General)
Technology
Technology (General)
Industrial engineering
Management engineering
Applied mathematics
Quantitative methods
You May Also Like
Refrences
Title Journal Journal Categories Citations Publication Date
Algorithm 97: Shortest path Communications of the ACM
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
 1,602 1962
10.1007/978-1-4471-5559-1
10.1145/1998196.1998218
10.1007/978-3-319-21275-3
10.1109/TPAMI.2008.289