![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
BibTeX record journals/algorithmica/EadesW96
@article{DBLP:journals/algorithmica/EadesW96, author = {Peter Eades and Sue Whitesides}, title = {The Realization Problem for Euclidean Minimum Spanning Trees in NP-Hard}, journal = {Algorithmica}, volume = {16}, number = {1}, pages = {60--82}, year = {1996}, url = {https://doi.org/10.1007/BF02086608}, doi = {10.1007/BF02086608}, timestamp = {Wed, 17 May 2017 14:25:13 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/EadesW96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.