"An O(n½+∑)-Space and Polynomial-Time Algorithm for Directed ..."

Tatsuya Imai et al. (2013)

> Home

Details and statistics

DOI: 10.1109/CCC.2013.35

access: closed

type: Conference or Workshop Paper

metadata version: 2024-02-05

- view
  authority control:
- export record
  dblp key:
  - conf/coco/ImaiNPVW13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/coco/ImaiNPVW13
Tatsuya Imai, Kotaro Nakagawa, Aduri Pavan, N. V. Vinodchandran, Osamu Watanabe:
An O(n½+∑)-Space and Polynomial-Time Algorithm for Directed Planar Reachability. CCC 2013: 277-286

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.