"An O(nε) Space and Polynomial Time Algorithm ..."

Diptarka Chakraborty, Raghunath Tewari (2018)

> Home

Details and statistics

DOI: 10.1145/3154857

access: closed

type: Journal Article

metadata version: 2020-07-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/toct/ChakrabortyT18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/toct/ChakrabortyT18
Diptarka Chakraborty, Raghunath Tewari:
An O(n^ε) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs. ACM Trans. Comput. Theory 9(4): 19:1-19:11 (2018)

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.