Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

On graphs coverable by \(k\) shortest paths

From MaRDI portal
Publication:6602460
Jump to:navigation, search

DOI10.4230/LIPICS.ISAAC.2022.40MaRDI QIDQ6602460

Ioan Todinca, Florent Foucaud, Maël Dumas, Anthony Perez

Publication date: 11 September 2024





zbMATH Keywords

shortest pathscovering problemsParameterized complexity


Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)








This page was built for publication: On graphs coverable by \(k\) shortest paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6602460)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6602460&oldid=40150798"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 13 February 2025, at 19:20.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki