SIAM Journal / Cambridge University Press / John Hopkins University Press / /
Country
France / Jordan / United States / Slovenia / /
Currency
pence / USD / / /
Event
Product Recall / Product Issues / /
Facility
FMF University of Ljubljana / University of Cambridge / /
IndustryTerm
directed planar networks / linear time using depth-first search / post-processing step / post-processing steps / nearlinear-time algorithms / rotation systems / improved netweok optimization algorithms / considered computing shortest cycles / deterministic near-linear time algorithm / planar undirected network / linear time shortest path algorithm / generic algorithm / post-processing / time pre-processing / computing / pre-processing / post-processing time / shortest-path algorithms / /
Organization
Cambridge University / G in O / University of Ljubljana / Slovenian Research Agency / French Ministry of Foreign and European Affairs / University of Cambridge / IMFM Department of Mathematics / French Ministry of Foreign / Department of Mathematics / /
Person
Colin de Verdi / Francis Lazarus / /
Position
General / /
Product
Computing Shortest Non-Trivial Loops / /
ProvinceOrState
Utah / New York / /
PublishedMedium
SIAM Journal on Computing / Journal of the ACM / Computer Graphics / Theory of Computing / /
Technology
Graph algorithms / 6.3 Improved Algorithm / Nonnumerical algorithms / L. This algorithm / improved netweok optimization algorithms / time algorithm / deterministic near-linear time algorithm / generic algorithm / Faster shortest-path algorithms / linear time shortest path algorithm / nearlinear-time algorithms / family L. The algorithm / /
Finding Shortest Non-Trivial Cycles ∗ in Directed Graphs on Surfaces Sergio Cabello Éric Colin de Verdière