Back to Results
First PageMeta Content
Connectivity / SPQR tree / Apex graph / Shortest path problem / Breadth-first search / Crossing number / Graph theory / Mathematics / Planar graphs


A Tighter Insertion-based Approximation of the Crossing Number Markus Chimani⋆1 and Petr Hlinˇen´ y⋆⋆ 2 1
Add to Reading List

Document Date: 2011-05-24 08:45:38

Open Document

File Size: 212,99 KB

Share Result on Facebook

Company

Q. / QG / MEI / /

Currency

pence / /

/

Facility

University Jena / /

IndustryTerm

polynomial algorithm / breath-first search / evaluated sub-algorithms / implementable algorithm / approximation algorithm / insertion algorithm / approximate solution / insertion solution / linear-time algorithm / approximation solution / approximation algorithms / /

Organization

Masaryk University / Czech Science Foundation / Faculty of Informatics / /

Person

Petr Hlin / Markus Chimani / /

Technology

BFS algorithm / main algorithm / 2 1 Algorithm / BFS algorithms / experimentally evaluated sub-algorithms / aforementioned algorithms / connected G. Our algorithm / approximation algorithm / approximation algorithms / linear-time algorithm / insertion algorithm / directly implementable algorithm / polynomial algorithm / /

SocialTag