Skip to Main content Skip to Navigation
Journal articles

NP-Completeness Results for Minimum Planar Spanners

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Thursday, March 13, 2014 - 3:52:08 PM
Last modification on : Wednesday, November 29, 2017 - 10:26:24 AM
Long-term archiving on: : Friday, June 13, 2014 - 11:52:07 AM


Files produced by the author(s)




Ulrik Brandes, Dagmar Handke. NP-Completeness Results for Minimum Planar Spanners. Discrete Mathematics and Theoretical Computer Science, DMTCS, 1998, Vol. 3 no. 1 (1), pp.1-10. ⟨10.46298/dmtcs.257⟩. ⟨hal-00958903⟩



Record views


Files downloads