Carregant...
Polynomial Time Algorithms for Tracking Path Problems
Given a graph G, and terminal vertices s and t, the Tracking Paths problem asks to compute a minimum number of vertices to be marked as trackers, such that the sequence of trackers encountered in each [Formula: see text]-[Formula: see text] path is unique. Tracking Paths is NP-hard in both directed...
Guardat en:
| Publicat a: | Combinatorial Algorithms |
|---|---|
| Autor principal: | |
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
2020
|
| Matèries: | |
| Accés en línia: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7254916/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-48966-3_13 |
| Etiquetes: |
Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|