Back to Results
First PageMeta Content
Group actions / Group theory / Abstract interpretation / Galois connection / Order theory / Structure / Orbifold / Holomorphic functional calculus / Abstract algebra / Mathematics / Algebra


Calculating Graph Algorithms for Dominance and Shortest Path⋆ Ilya Sergey1 , Jan Midtgaard2 , and Dave Clarke1 1 KU Leuven, Belgium
Add to Reading List

Document Date: 2014-05-28 18:27:05


Open Document

File Size: 243,36 KB

Share Result on Facebook

Country

Belgium / Denmark / /

/

Event

Person Communication and Meetings / /

Facility

Aarhus University / /

IndustryTerm

shortest path algorithms / iterative graph algorithms / dominance algorithm / polynomial-time graph algorithms / graph algorithms / shortest path algorithm / iterative algorithms / polynomialtime algorithms / dominance computation algorithm / /

Organization

Aarhus University / eta / /

Position

first author / /

Technology

Calculating Graph Algorithms / graph algorithms / shortest path algorithms / dominance computation algorithm / dom / two iterative / polynomial-time graph algorithms / dominance algorithm / shortest path algorithm / iterative graph algorithms / polynomialtime algorithms / /

SocialTag