Author image not provided
 Diptarka Chakraborty

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article0.00
Citation Count0
Publication count1
Publication years2017-2017
Available for download1
Average downloads per article26.00
Downloads (cumulative)26
Downloads (12 Months)26
Downloads (6 Weeks)26
SEARCH
ROLE


AUTHOR'S COLLEAGUES
See all colleagues of this author




BOOKMARK & SHARE


1 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 1 of 1
Sort by:

1 published by ACM
December 2017 ACM Transactions on Computation Theory (TOCT): Volume 9 Issue 4, January 2018
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 26,   Downloads (12 Months): 26,   Downloads (Overall): 26

Full text available: PDFPDF
Given a graph G and two vertices s and t in it, graph reachability is the problem of checking whether there exists a path from s to t in G . We show that reachability in directed layered planar graphs can be decided in polynomial time and O ( n ...
Keywords: Directed reachability problem, layered grid graph, layered planar graph, time-space tradeoff



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us