First Page | Document Content | |
---|---|---|
Date: 2008-07-03 09:38:15Graph theory Planar graphs SPQR tree Planarization Dual graph Topological graph theory Biconnected graph Simultaneous embedding Planarity testing | UNIVERSITÄT DORTMUND FACHBEREICH INFORMATIK DiplomarbeitAdd to Reading ListSource URL: ls11-www.cs.tu-dortmund.deDownload Document from Source WebsiteFile Size: 1,11 MBShare Document on Facebook |
UNIVERSITÄT DORTMUND FACHBEREICH INFORMATIK DiplomarbeitDocID: 1rkPg - View Document | |
Testing Maximal 1-planarity of Graphs with a Rotation System in Linear Time ⋆ Peter Eades1 , Seok-Hee Hong1 , Naoki Katoh2 , Giuseppe Liotta3 , Pascal Schweitzer4 , and Yusuke Suzuki5 1DocID: 1qaEP - View Document | |
Beyond Planarity: Testing Full Outer-2-Planarity in Linear Time Seok-Hee Hong1 and Hiroshi Nagamochi2 1 University of Sydney, AustraliaDocID: 1pWdX - View Document | |
A Linear-Time Algorithm for Testing Outer-1-Planarity? Seok-Hee Hong1 , Peter Eades1 , Naoki Katoh2 , Giuseppe Liotta3 , Pascal Schweitzer4 , and Yusuke Suzuki5 1DocID: 1pQMh - View Document | |
Clustered planarity testing revisited ¨ ot ¨ or ¨ Palv ´ olgyi ¨DocID: 1on7u - View Document |