Reconfiguring shortest paths in graphs

From MaRDI portal

Publication:6623589

Jump to:navigation, search

DOI10.1007/s00453-024-01263-yMaRDI QIDQ6623589

Abhiruk Lahiri, Kshitij Gajjar, Agastya Vibhuti Jha, Manish Kumar

Publication date: 24 October 2024

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

shortest path line graph PSPACE-complete hardness of approximation bridged graph reconfiguration circle graph Boolean hypercube

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

This page was built for publication: Reconfiguring shortest paths in graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6623589&oldid=40183092"