![](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 conf/wg/NagaiN00
@inproceedings{DBLP:conf/wg/NagaiN00, author = {Sayaka Nagai and Shin{-}Ichi Nakano}, editor = {Ulrik Brandes and Dorothea Wagner}, title = {A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop, {WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1928}, pages = {290--301}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-40064-8\_27}, doi = {10.1007/3-540-40064-8\_27}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/wg/NagaiN00.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.