A Space-Efficient Separator Algorithm for Planar Graphs-Reference-Cited by-同舟云学术

A Space-Efficient Separator Algorithm for Planar Graphs

Published:2019-09-01 Issue:9 Volume:E102.A Page:1007-1016
ISSN:0916-8508
Container-title:IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
language:en
Short-container-title:IEICE Trans. Fundamentals

Author:

ASHIDA Ryo¹,KUHNERT Sebastian²,WATANABE Osamu¹

Affiliation:

1. School of Computing, Tokyo Institute of Technology

2. Department of Computer Science, Humboldt University of Berlin

Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Subject

Applied Mathematics,Electrical and Electronic Engineering,Computer Graphics and Computer-Aided Design,Signal Processing

Link

https://www.jstage.jst.go.jp/article/transfun/E102.A/9/E102.A_1007/_pdf

Reference11 articles.

1. [1] E. Allender and M. Mahajan, “The complexity of planarity testing,” Inform. Comput., vol.189, no.1, pp.117-134, 2004. 10.1016/j.ic.2003.09.002

2. [2] T. Asano and B. Doerr, “Memory-constrained algorithms for shortest path problem,” Proc. 24th Canadian Conference on Computational Geometry, 2011.

3. [3] T. Asano, D. Kirkpatrick, K. Nakagawa, and O. Watanabe, “Õ(√n)-space and polynomial-time algorithm for planar directed graph reachability,” Proc. Int'l Sympos. on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, vol.8635, pp.45-56, 2014. 10.1007/978-3-662-44465-8_5

4. [4] R. Ashida and K. Nakagawa, “Õ(n^1/3)-space algorithm for the grid graph reachability problem,” Proc. 34th Int. Symp. Computational Geometry, pp.5:1-5:13, 2018.

5. [5] S. Cook and P. McKenzie, “Problems complete for logarithmic space,” J. Algorithms, vol.8, no.3, pp.385-394, 1986. 10.1016/0196-6774(87)90018-6

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Space Efficient Separator Algorithms for Planar Graphs;WALCOM: Algorithms and Computation;2020