A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths

Luca Allulli; Peter Lichodzijewski; Norbert Zeh

A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths

Luca Allulli, Peter Lichodzijewski, Norbert Zeh

Pharmacology, Toxicology and Pharmaceutics

科研成果: 图书/报告稿件的类型 › 会议稿件

源语言	英语
主期刊名	Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007
出版商	Association for Computing Machinery
页	910-919
页数	10
ISBN（电子版）	9780898716245
出版状态	已出版 - 2007
活动	18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007 - New Orleans, 美国期限: 1月 7 2007 → 1月 9 2007

出版系列

姓名	Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
卷	07-09-January-2007

会议

会议	18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007
国家/地区	美国
市	New Orleans
时期	1/7/07 → 1/9/07

!!!ASJC Scopus Subject Areas

软件
一般数学

其它文件与链接

引用此

Allulli, L., Lichodzijewski, P., & Zeh, N. (2007). A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths. 在 Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007 (页码 910-919). (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; 卷 07-09-January-2007). Association for Computing Machinery.

A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths. / Allulli, Luca; Lichodzijewski, Peter; Zeh, Norbert.
Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007. Association for Computing Machinery, 2007. 页码 910-919 (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; 卷 07-09-January-2007).

科研成果: 图书/报告稿件的类型 › 会议稿件

Allulli, L, Lichodzijewski, P & Zeh, N 2007, A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths. 在 Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 卷 07-09-January-2007, Association for Computing Machinery, 页码 910-919, 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, 美国, 1/7/07.

@inproceedings{230f7d8046c644c58cb4e955a4b122bf,

title = "A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths",

author = "Luca Allulli and Peter Lichodzijewski and Norbert Zeh",

note = "Funding Information: Supported in part by the research project {"}Algoritmi evoluti per Internet e per il Web{"} sponsored by the University of Rome {"}La Sapienza{"}, and by the Natural Sciences and Engineering Research Council of Canada. Supported by the Natural Sciences and Engineering Research Council of Canada and the Canadian Foundation for Innovation. Publisher Copyright: Copyright {\textcopyright} 2007 by the Association for Computing Machinery, Inc. and the Society for Industrial and Applied Mathematics.; 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007 ; Conference date: 07-01-2007 Through 09-01-2007",

year = "2007",

language = "English",

series = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",

publisher = "Association for Computing Machinery",

pages = "910--919",

booktitle = "Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007",

}

TY - GEN

T1 - A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths

AU - Allulli, Luca

AU - Lichodzijewski, Peter

AU - Zeh, Norbert

N1 - Funding Information: Supported in part by the research project "Algoritmi evoluti per Internet e per il Web" sponsored by the University of Rome "La Sapienza", and by the Natural Sciences and Engineering Research Council of Canada. Supported by the Natural Sciences and Engineering Research Council of Canada and the Canadian Foundation for Innovation. Publisher Copyright: Copyright © 2007 by the Association for Computing Machinery, Inc. and the Society for Industrial and Applied Mathematics.

PY - 2007

Y1 - 2007

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

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

M3 - Conference contribution

AN - SCOPUS:70349326832

T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

SP - 910

EP - 919

BT - Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007

PB - Association for Computing Machinery

T2 - 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007

Y2 - 7 January 2007 through 9 January 2007

ER -

A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths

出版系列

会议

!!!ASJC Scopus Subject Areas

其它文件与链接

指纹

引用此