NP-completeness results for minimum planar spanners.
Brandes, Ulrik; Handke, Dagmar
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] (1998)
- Volume: 3, Issue: 1, page 1-10
- ISSN: 1365-8050
Access Full Article
top
How to cite
topBrandes, Ulrik, and Handke, Dagmar. "NP-completeness results for minimum planar spanners.." Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] 3.1 (1998): 1-10. <http://eudml.org/doc/120593>.
@article{Brandes1998,
author = {Brandes, Ulrik, Handke, Dagmar},
journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},
keywords = {graph spanners; planar spanners},
language = {eng},
number = {1},
pages = {1-10},
publisher = {Maison de l'Informatique et des Mathématiques Discrètes, MIMD},
title = {NP-completeness results for minimum planar spanners.},
url = {http://eudml.org/doc/120593},
volume = {3},
year = {1998},
}
TY - JOUR
AU - Brandes, Ulrik
AU - Handke, Dagmar
TI - NP-completeness results for minimum planar spanners.
JO - Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
PY - 1998
PB - Maison de l'Informatique et des Mathématiques Discrètes, MIMD
VL - 3
IS - 1
SP - 1
EP - 10
LA - eng
KW - graph spanners; planar spanners
UR - http://eudml.org/doc/120593
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.