Back to Results
First PageMeta Content
Search algorithms / Topological sorting / Directed acyclic graph / NP-complete problems / Algorithm / Depth-first search / Longest path problem / Path decomposition / Graph theory / Mathematics / Theoretical computer science


A Dynamic Topological Sort Algorithm for Directed Acyclic Graphs DAVID J. PEARCE
Add to Reading List

Document Date: 2007-01-25 16:40:07


Open Document

File Size: 1,72 MB

Share Result on Facebook

City

New York / /

Company

Hoover / ACM Inc. / /

Country

United States / /

Currency

USD / /

/

Facility

Penn Plaza / PAUL H. J. KELLY Imperial College / Imperial College / South Kensington Campus / Victoria University of Wellington / Directed Acyclic Graphs DAVID J. PEARCE Victoria University of Wellington / /

/

IndustryTerm

static solution / linear time algorithms / main existing solutions / backward depth-first search / forward search / trivial solution / dynamic algorithm / main previous solutions / search cost / forward and backward search / unit change algorithm / correct solution / graph algorithms / forward depth-first search / identified using a forward depth-first search / /

Organization

Victoria University of Wellington / Imperial College London / School of Mathematics / Statistics and Computer Science / Department of Computing / UK Engineering and Physical Sciences Research Council / /

Person

Kelly Fig / DAVID J. PEARCE / PAUL H. J. KELLY / /

/

Position

Queen / Graph algorithms General / D. J. / /

ProvinceOrState

New York / /

Technology

3.1 Algorithm PK Algorithm / Graph algorithms / Dynamic graph algorithms / three algorithms / two previous algorithms / linear time algorithms / PK algorithm / MNR algorithm / unit change algorithm / partially dynamic algorithm / 3.2 The MNR Algorithm The algorithm / 3.3 The AHRSZ Algorithm The algorithm / Dynamic Topological Sort Algorithm / here.1 Algorithm / /

SocialTag