I/O-Efficient Path Traversal in Succinct Planar Graphs

Craig Dillabaugh; Meng He; Anil Maheshwari; Norbert Zeh

doi:10.1007/s00453-015-0086-7

I/O-Efficient Path Traversal in Succinct Planar Graphs

Craig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh

科研成果: 期刊稿件 › 文章 › 同行评审

源语言	英语
页（从-至）	714-755
页数	42
期刊	Algorithmica
卷	77
期	3
DOI	https://doi.org/10.1007/s00453-015-0086-7
出版状态	已出版 - 3月 1 2017

!!!ASJC Scopus Subject Areas

一般计算机科学
计算机科学应用
应用数学

访问文件

10.1007/s00453-015-0086-7

其它文件与链接

引用此

@article{65d289029a2c4b079984797c00af290e,

title = "I/O-Efficient Path Traversal in Succinct Planar Graphs",

author = "Craig Dillabaugh and Meng He and Anil Maheshwari and Norbert Zeh",

note = "Publisher Copyright: {\textcopyright} 2015, Springer Science+Business Media New York.",

year = "2017",

month = mar,

day = "1",

doi = "10.1007/s00453-015-0086-7",

language = "English",

volume = "77",

pages = "714--755",

journal = "Algorithmica",

issn = "0178-4617",

publisher = "Springer New York",

number = "3",

}

TY - JOUR

T1 - I/O-Efficient Path Traversal in Succinct Planar Graphs

AU - Dillabaugh, Craig

AU - He, Meng

AU - Maheshwari, Anil

AU - Zeh, Norbert

PY - 2017/3/1

Y1 - 2017/3/1

UR - http://www.scopus.com/inward/record.url?scp=84949935109&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84949935109&partnerID=8YFLogxK

U2 - 10.1007/s00453-015-0086-7

DO - 10.1007/s00453-015-0086-7

M3 - Article

AN - SCOPUS:84949935109

SN - 0178-4617

VL - 77

SP - 714

EP - 755

JO - Algorithmica

JF - Algorithmica

IS - 3

ER -

I/O-Efficient Path Traversal in Succinct Planar Graphs

!!!ASJC Scopus Subject Areas

访问文件

其它文件与链接

指纹

引用此