%0 Journal Article %1 journals/corr/ChakrabortyT15 %A Chakraborty, Diptarka %A Tewari, Raghunath %D 2015 %J CoRR %K dblp %T An $O(n^ε)$ Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs. %U http://dblp.uni-trier.de/db/journals/corr/corr1501.html#ChakrabortyT15 %V abs/1501.05828

@article{journals/corr/ChakrabortyT15, added-at = {2018-08-13T00:00:00.000+0200}, author = {Chakraborty, Diptarka and Tewari, Raghunath}, biburl = {https://www.bibsonomy.org/bibtex/2110d62ec29b4439c461aecf6b983b4ca/dblp}, ee = {http://arxiv.org/abs/1501.05828}, interhash = {078303a823fc4883250df0431036a5ed}, intrahash = {110d62ec29b4439c461aecf6b983b4ca}, journal = {CoRR}, keywords = {dblp}, timestamp = {2018-08-14T13:34:25.000+0200}, title = {An $O(n^ε)$ Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs.}, url = {http://dblp.uni-trier.de/db/journals/corr/corr1501.html#ChakrabortyT15}, volume = {abs/1501.05828}, year = 2015 }