Geodesic
NP-Completeness Results for Minimum Planar Spanners
Discrete mathematics & theoretical computer science, Tome 3 (1998-1999) no. 1.

Voir la notice de l'article provenant de la source Episciences

For any fixed parameter t greater or equal to 1, a \emph t-spanner of a graph G is a spanning subgraph in which the distance between every pair of vertices is at most t times their distance in G. A \emph minimum t-spanner is a t-spanner with minimum total edge weight or, in unweighted graphs, minimum number of edges. In this paper, we prove the NP-hardness of finding minimum t-spanners for planar weighted graphs and digraphs if t greater or equal to 3, and for planar unweighted graphs and digraphs if t greater or equal to 5. We thus extend results on that problem to the interesting case where the instances are known to be planar. We also introduce the related problem of finding minimum \emphplanar t-spanners and establish its NP-hardness for similar fixed values of t. 
@article{DMTCS_1998_3_1_a0,
     author = {Brandes, Ulrik and Handke, Dagmar},
     title = {NP-Completeness {Results} for {Minimum} {Planar} {Spanners}},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {3},
     number = {1},
     year = {1998-1999},
     doi = {10.46298/dmtcs.257},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.257/}
}
TY  - JOUR
AU  - Brandes, Ulrik
AU  - Handke, Dagmar
TI  - NP-Completeness Results for Minimum Planar Spanners
JO  - Discrete mathematics & theoretical computer science
PY  - 1998-1999
VL  - 3
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.257/
DO  - 10.46298/dmtcs.257
LA  - en
ID  - DMTCS_1998_3_1_a0
ER  - 
%0 Journal Article
%A Brandes, Ulrik
%A Handke, Dagmar
%T NP-Completeness Results for Minimum Planar Spanners
%J Discrete mathematics & theoretical computer science
%D 1998-1999
%V 3
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.257/
%R 10.46298/dmtcs.257
%G en
%F DMTCS_1998_3_1_a0
Brandes, Ulrik; Handke, Dagmar. NP-Completeness Results for Minimum Planar Spanners. Discrete mathematics & theoretical computer science, Tome 3 (1998-1999) no. 1. doi : 10.46298/dmtcs.257. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.257/

Cité par Sources :