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

	UNIVERSITÄT DORTMUND FACHBEREICH INFORMATIK Diplomarbeit DocID: 1rkPg - View Document
	Noname manuscript No. (will be inserted by the editor) A portable parallel implementation of the lrs vertex enumeration code David Avis and Gary Roumanis DocID: 1qDjI - View Document
	Microsoft PowerPoint - Presentation2 DocID: 1qw1W - View Document
	Downloadedto. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php SIAM J. COMPUT. Vol. 2, No. 4, DecemberSET MERGING ALGORITHMS* DocID: 1pVrn - View Document
	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Optimal Data Structures for Farthest-Point Queries in Cactus Networks∗ Prosenjit Bose† Jean-Lou De Carufel† DocID: 186p2 - View Document