Path Separability of Graphs
Idioma
en
Document de travail - Pré-publication
Resumen en inglés
In this paper we investigate the structural properties of $k$-path separable graphs, that are the graphs that can be separated by a set of $k$ shortest paths. We identify several graph families having such path separability, ...Leer más >
Palabras clave en inglés
shortest path
separator
graph minor theory
graph algorithms