Back to Results
First PageMeta Content
Graph operations / Planar graphs / Graph embedding / Graph / Shortest path problem / Degree / Rotation system / Minor / Spanning tree / Graph theory / Mathematics / Topological graph theory


Algorithms for the Edge-Width of an Embedded Graph∗ Sergio Cabello† ´ Eric Colin de Verdi`ere‡
Add to Reading List

Document Date: 2012-02-15 15:38:13

Open Document

File Size: 207,07 KB

Share Result on Facebook

City

Grenoble / Paris / /

Company

Elsevier Science B.V. / /

Country

France / Slovenia / /

Currency

pence / /

/

Facility

University of Ljubljana / /

IndustryTerm

linear time using depth-first search / subquadratic-time algorithm / decision algorithm / alternate algorithms / output-sensitive algorithm / approximation algorithm / fundamental tool / rotation systems / greedy algorithm / breadth-first search / linear-time algorithm / computing / /

Organization

University of Ljubljana / IMFM / Slovenian Research Agency / French Ministry of Foreign and European Affairs / French Ministry of Foreign / Department of Mathematics / /

Person

Sergio Cabello / Eric Colin de Verdi / Francis Lazarus / /

Product

Lemma 4 / /

Technology

approximation algorithm / 2-approximation algorithm / time algorithm / greedy algorithm / linear-time algorithm / subquadratic-time algorithm / decision algorithm / /

SocialTag