Back to Results
First PageMeta Content
Planar graphs / Graph operations / Apex graph / Minor / Crossing number / Rotation system / Homeomorphism / Dual graph / Degree / Graph theory / Mathematics / Topological graph theory


Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface Petr Hlinˇ en´ y1 and Markus Chimani2 1
Add to Reading List

Document Date: 2009-07-05 16:42:00

Open Document

File Size: 198,48 KB

Share Result on Facebook

City

Brno / /

Company

Drawing Algorithm / 3M / /

Country

Germany / Czech Republic / /

Currency

cent / /

/

Facility

Masaryk University / /

IndustryTerm

polynomial algorithm / actual approximation algorithm / the¢ algorithm / constant factor approximation algorithm / published algorithms / homotopy-related tools / breadth-first search / graph drawing applications / approximation algorithm / overall algorithm / linear time algorithm / recent algorithms / constant factor approximation algorithms / /

Organization

Masaryk University / Faculty of Computer Science / Faculty of Informatics / /

Person

Salazar / /

Technology

the¢ algorithm / previously published algorithms / linear time algorithm / constant factor approximation algorithm / actual approximation algorithm / overall algorithm / approximation algorithm / constant factor approximation algorithms / Faster recent algorithms / polynomial algorithm / /

SocialTag