Posledni kousky Q-Heapu a jejich aplikace na kostry.

[ga.git] / ga.bib

diff --git a/ga.bib b/ga.bib
index 43c7e23b1870ca3a80c8adcafa7f45f6ebaccd04..ffd73c4acdc7e508e67c976e3eaf1dac54b659cd 100644 (file)
--- a/ga.bib
+++ b/ga.bib
@@ -330,3 +330,44 @@
     publisher = "SNTL",
     address = "Praha"
 }
+
+@article{ boyer:cutting,
+  title={{On the cutting edge: Simplified $\O(n)$ planarity by edge addition}},
+  author={Boyer, J.M. and Myrvold, W.J.},
+  journal={Journal of Graph Algorithms and Applications},
+  volume={8},
+  number={3},
+  pages={241--273},
+  year={2004}
+}
+
+@article{ tarjan:planarity,
+  title={{Efficient Planarity Testing}},
+  author={Hopcroft, J. and Tarjan, R.},
+  journal={Journal of the ACM (JACM)},
+  volume={21},
+  number={4},
+  pages={549--568},
+  year={1974},
+  publisher={ACM Press New York, NY, USA}
+}
+
+@article{ schnyder:grid,
+  title={{Embedding planar graphs on the grid}},
+  author={Schnyder, W.},
+  journal={Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms},
+  pages={138--148},
+  year={1990},
+  publisher={Society for Industrial and Applied Mathematics Philadelphia, PA, USA}
+}
+
+@article{ chrobak:grid,
+  title={{A linear-time algorithm for drawing a planar graph on a grid}},
+  author={Chrobak, M. and Payne, T. H.},
+  journal={Information Processing Letters},
+  volume={54},
+  number={4},
+  pages={241--246},
+  year={1995},
+  publisher={Elsevier Science}
+}