"Finding Longest (s, t)-paths of O-shaped Supergrid Graphs in Linear Time."

Ruo-Wei Hung et al. (2019)

> Home

Details and statistics

DOI: 10.1109/ICAWST.2019.8923400

access: closed

type: Conference or Workshop Paper

metadata version: 2022-04-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/icawst/HungKTQ19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icawst/HungKTQ19
Ruo-Wei Hung, Fatemeh Keshavarz-Kohjerdi, Yuh-Min Tseng, Guo-Hao Qiu:
Finding Longest (s, t)-paths of O-shaped Supergrid Graphs in Linear Time. iCAST 2019: 1-8

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.