"An O(n^ε ) Space and Polynomial Time Algorithm for Reachability in ..."

Diptarka Chakraborty, Raghunath Tewari (2015)

> Home

Details and statistics

DOI: 10.1007/978-3-662-48971-0_52

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/isaac/ChakrabortyT15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/ChakrabortyT15
Diptarka Chakraborty, Raghunath Tewari:
An O(n^ε ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs. ISAAC 2015: 614-624

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.