Berlin / Springer-Verlag / Snowbird / Grenoble / /
Company
SIAM Journal / Cambridge University Press / Johns Hopkins University Press / /
Country
France / United States / /
Currency
pence / USD / / /
Facility
FMF University of Ljubljana / /
IndustryTerm
linear time using depth-first search / subquadratic-time algorithm / faster algorithms / alternate algorithms / output-sensitive algorithm / fundamental tool / rotation systems / greedy algorithm / breadth-first search / linear-time algorithm / computing / breadthfirst search / /
Organization
Cambridge University / University of Ljubljana / Slovenian Research Agency / American Mathematical Society / French Ministry of Foreign and European Affairs / IMFM Department of Mathematics / French Ministry of Foreign / Department of Mathematics / Johns Hopkins University / /
Person
Colin de Verdi / Francis Lazarus / Jeff Erickson / Éric Colin de Verdière / /
Position
General / /
ProgrammingLanguage
Lazarus / /
ProvinceOrState
Utah / New York / /
PublishedMedium
Transactions of the American Mathematical Society / Computer Graphics / Theory of Computing / /
Technology
Graph algorithms / main algorithm / Faster Algorithm / Nonnumerical algorithms / known algorithms / time algorithm / greedy algorithm / linear-time algorithm / there faster algorithms / subquadratic-time algorithm / /
Output-Sensitive Algorithm for the Edge-Width ∗ of an Embedded Graph Sergio Cabello