Parameterized Complexity of Directed Spanner Problems.

Fomin, Fedor V; Golovach, Petr A; Lochet, William; Misra, Pranabendu; Saurabh, Saket; Sharma, Roohani

Fomin, Fedor V; Golovach, Petr A; Lochet, William; Misra, Pranabendu; Saurabh, Saket; Sharma, Roohani.

Afiliación

Fomin FV; Department of Informatics, University of Bergen, PB 7803, 5020 Bergen, Norway.
Golovach PA; Department of Informatics, University of Bergen, PB 7803, 5020 Bergen, Norway.
Lochet W; Department of Informatics, University of Bergen, PB 7803, 5020 Bergen, Norway.
Misra P; Max Planck Institute for Informatics, Saarland Informatics Campus, Saarbrücken, Germany.
Saurabh S; Department of Informatics, University of Bergen, PB 7803, 5020 Bergen, Norway.
Sharma R; Institute of Mathematical Sciences, HBNI, Chennai, India.

Algorithmica ; 84(8): 2292-2308, 2022.

Article en En | MEDLINE | ID: mdl-35880198

Palabras clave

Directed graphs; Graph spanners; Kernelization; Parameterized complexity

Texto completo

Añadir a Mi BVS

Imprimir

XML

PubMed Links

Buscar en Google

Texto completo: 1 Colección: 01-internacional Base de datos: MEDLINE Tipo de estudio: Clinical_trials Idioma: En Revista: Algorithmica Año: 2022 Tipo del documento: Article País de afiliación: Noruega Pais de publicación: Estados Unidos

Texto completo

Añadir a Mi BVS

Imprimir

XML

PubMed Links

Buscar en Google