| Document Date: 2009-11-24 09:49:23
Open Document File Size: 99,43 KBShare Result on Facebook
City Saarbr¨ucken / Vancouver / / Company MIT Press / / Country Germany / Canada / / / Facility International Computer Science Institute / Stony Brook University / / IndustryTerm separate graph search / online topological ordering / topological-ordering algorithm / on-line algorithms / sparse-graph algorithms / to those algorithms / et al. algorithm / depth-first search / naive algorithm / prior algorithms / balanced search tree / list-based algorithms / simplest solution / to our algorithm / truncated depth-first search / to all previous algorithms / bodlaender algorithm / nontrivial solution / simpler algorithm / / OperatingSystem L3 / / Organization National Science Foundation / International Computer Science Institute / MIT / Stony Brook University / / Person Seth Gilbert / Michael A. Bender∗ Jeremy / Kavitha / Mathew / Robert E. Tarjan / / Position editor / / ProvinceOrState British Columbia / / PublishedMedium the Theory of Computing / Theoretical Computer Science / Lecture Notes in Computer Science / / Technology dynamic algorithm / topological-ordering algorithm / RAM / good algorithm / bodlaender algorithm / prior algorithms / Two simplified algorithms / list-based algorithms / on-line algorithms / Alpern et al. algorithm / previous algorithms / sparse-graph algorithms / naive algorithm / simpler algorithm / 3 Algorithm / Kelly algorithms / Katriel-Bodlaender algorithm / Two algorithms / /
SocialTag |
A New Approach to Incremental Topological Ordering Michael A. Bender∗ Jeremy T. Fineman† Abstract