Last update: Sun Oct 15 02:37:12 MDT 2017
Top |
Symbols |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Han:2012:TAA,
author = "Yijie Han and Tadao Takaoka",
title = "An {$O(n^3 \log \log n / \log^2 n)$} Time Algorithm
for All Pairs Shortest Paths",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7357",
pages = "131--141",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-31155-0_12",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:20:48 MST 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/lncs2012f.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-31155-0_12/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-31155-0",
book-URL = "http://www.springerlink.com/content/978-3-642-31155-0",
fjournal = "Lecture Notes in Computer Science",
}
Related entries
- algorithm,
7353(0)1,
7354(0)70,
7354(0)110,
7355(0)48,
7355(0)61,
7357(0)107,
7357(0)119,
7357(0)142,
7357(0)177,
7357(0)225,
7359(0)131,
7362(0)216,
7367(0)1,
7367(0)47,
7367(0)106,
7368(0)1,
7368(0)20,
7368(0)159,
7369(0)208,
7369(0)225,
7370(0)228,
7372(0)43,
7373(0)19,
7373(0)111,
7376(0)117,
7377(0)1,
7377(0)224,
7381(0)149,
7387(0)46,
7389(0)73,
7389(0)95,
7389(0)128,
7389(0)137,
7390(0)35,
7390(0)59,
7390(0)67,
7390(0)89,
7390(0)111,
7391(0)145,
7391(0)157,
7392(0)24
- all,
7353(0)81,
7354(0)2,
7354(0)149,
7374(0)188,
7382(0)18,
7385(0)117
- pair,
7353(0)138
- path,
7354(0)70,
7357(0)142,
7357(0)153,
7359(0)1,
7397(0)98
- Shortest,
7354(0)70
- time,
7353(0)172,
7354(0)149,
7356(0)73,
7357(0)142,
7367(0)132,
7367(0)149,
7377(0)52,
7392(0)141,
7392(0)189,
7395(0)192