O(n^2.75) algorithm for incremental topological ordering.">O(n^2.75) algorithm for incremental topological ordering., dblp, computer science, bibliography, knowledge graph, author, editor, publication, conference, journal, book, thesis, database, collection, open data, bibtex">

default search action

combined dblp search
author search
venue search
publication search

ask others

"An O(n2.75) algorithm for incremental topological ..."

Deepak Ajwani, Tobias Friedrich, Ulrich Meyer (2008)

> Home

Details and statistics

DOI: 10.1145/1383369.1383370

access: closed

type: Journal Article

metadata version: 2019-09-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/talg/AjwaniFM08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/AjwaniFM08
Deepak Ajwani, Tobias Friedrich, Ulrich Meyer:
An O(n^2.75) algorithm for incremental topological ordering. ACM Trans. Algorithms 4(4): 39:1-39:14 (2008)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.