UNIVERSITÄT DORTMUND FACHBEREICH INFORMATIK Diplomarbeit

First Page		Document Content
Date: 2008-07-03 09:38:15 Graph theory Planar graphs SPQR tree Planarization Dual graph Topological graph theory Biconnected graph Simultaneous embedding Planarity testing		UNIVERSITÄT DORTMUND FACHBEREICH INFORMATIK Diplomarbeit Add to Reading List Source URL: ls11-www.cs.tu-dortmund.de Download Document from Source Website File Size: 1,11 MB Share Document on Facebook

	6.006 Intro to Algorithms QUIZ 2 REVIEW NOTES - Part 2 April 12, 2011 DocID: 1rsoU - View Document
	Note to other teachers and users of these slides: We would be delighted if you found this our material useful in giving your own lectures. Feel free to use these slides verbatim, or to modify them to fit your own needs. DocID: 1rmf4 - View Document
	UNIVERSITÄT DORTMUND FACHBEREICH INFORMATIK Diplomarbeit DocID: 1rkPg - View Document
	The planar slope-number of planar partial 3-trees of bounded degree Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesaˇr and Tomáš Vyskoˇcil Charles University in Prague University of Illin DocID: 1rfkH - View Document
	Simple realizability of complete abstract topological graphs simplified Jan Kynˇcl Charles University, Prague Graph: G = (V , E ), V finite, E ⊆ DocID: 1rec7 - View Document