Entry Dragan:2005:EAP from jalg.bib
Last update: Sat Oct 14 02:35:45 MDT 2017
Top |
Symbols |
Numbers |
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{Dragan:2005:EAP,
author = "Feodor F. Dragan",
title = "Estimating all pairs shortest paths in restricted
graph families: a unified approach",
journal = j-J-ALG,
volume = "57",
number = "1",
pages = "1--21",
month = sep,
year = "2005",
CODEN = "JOALDV",
DOI = "https://doi.org/10.1016/j.jalgor.2004.09.002",
ISSN = "0196-6774 (print), 1090-2678 (electronic)",
ISSN-L = "0196-6774",
bibdate = "Tue Dec 11 09:22:11 MST 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jalg.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0196677404001488",
acknowledgement = ack-nhfb,
fjournal = "Journal of Algorithms",
journal-URL = "http://www.sciencedirect.com/science/journal/01966774",
}
Related entries
- all,
2(3)261,
4(2)137,
4(2)150,
5(1)22,
5(2)281,
5(3)422,
6(2)265,
9(1)63,
14(3)344,
19(1)45,
24(1)20,
33(1)51
- approach,
2(3)301,
13(2)274,
18(3)403,
21(2)306,
22(2)270,
42(2)317,
55(2)142,
64(1)51,
64(2)79
- Dragan, Feodor F.,
61(2)60
- Estimating,
54(1)105
- family,
1(1)104,
5(1)80,
37(2)495,
38(1)84
- pair,
6(2)200,
19(1)45,
24(1)20
- path,
4(1)61,
4(4)303,
6(3)400,
8(3)395,
9(1)18,
9(2)276,
10(1)109,
12(4)615,
13(2)235,
14(3)449,
15(1)125,
17(2)207,
18(2)358,
19(1)45,
19(2)173,
19(3)432,
21(3)542,
23(1)51,
23(1)121,
24(1)20,
25(2)205,
27(1)1,
28(1)125,
29(2)204,
30(1)19,
34(1)90,
34(2)251,
34(2)337,
35(2)189,
35(2)235,
36(2)253,
38(2)335,
42(1)41,
47(1)1,
49(1)13,
49(1)86,
49(1)114,
49(2)284,
50(2)246,
56(1)50,
58(1)1,
62(1)1,
62(2)74
- restricted,
47(1)1,
48(1)160
- shortest,
6(3)400,
9(1)18,
13(2)235,
13(3)468,
14(3)449,
18(2)238,
19(1)45,
20(3)459,
23(1)51,
23(1)74,
24(1)20,
25(2)205,
27(1)1,
28(1)125,
30(1)19,
34(2)251,
35(2)189,
49(1)86,
49(1)114,
49(2)284,
62(1)1,
62(2)74
- unified,
2(3)301