Entry Brandenburg:2011:SPM from tcs2010.bib
Last update: Sun Mar 31 03:12:29 MDT 2019
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{Brandenburg:2011:SPM,
author = "Franz J. Brandenburg and Mao-cheng Cai",
title = "Shortest path and maximum flow problems in networks
with additive losses and gains",
journal = j-THEOR-COMP-SCI,
volume = "412",
number = "4--5",
pages = "391--401",
day = "4",
month = feb,
year = "2011",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed Aug 31 10:12:36 MDT 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
Related entries
- additive,
411(43)3877,
417(1)23,
547(z)1
- flow,
411(19)1974,
411(31)2798,
412(24)2577,
412(32)4123,
412(43)6036,
412(48)6712,
416(1)87,
467(z)68,
470(z)93,
484(z)70,
524(z)78,
526(z)28,
538(z)124,
538(z)167,
544(z)74,
550(z)1
- gain,
553(z)57
- maximum,
411(1)188,
411(7)986,
411(26)2537,
412(24)2577,
412(40)5515,
412(40)5527,
412(45)6290,
412(51)7075,
453(1)88,
460(1)26,
462(1)80,
469(z)24,
469(z)92,
470(z)1,
476(z)16,
478(z)33,
478(z)51,
501(z)72,
507(z)52,
511(z)42,
513(z)53,
514(z)61,
516(z)78,
518(z)1,
518(z)117,
522(z)54,
525(z)130,
530(z)1,
532(z)73,
550(z)21,
554(z)207,
556(z)63,
560(z)131
- path,
411(1)293,
411(7)967,
411(7)1013,
411(7)1212,
411(26)2454,
411(34)3042,
411(34)3247,
411(40)3774,
412(12)1275,
412(35)4504,
412(35)4513,
412(35)4570,
412(35)4636,
412(36)4841,
412(39)5205,
412(39)5340,
412(46)6570,
412(50)7009,
418(1)82,
439(1)16,
464(1)35,
465(z)28,
465(z)35,
471(z)12,
475(z)82,
491(z)103,
506(z)55,
507(z)83,
510(z)1,
511(z)42,
511(z)117,
513(z)1,
520(z)43,
525(z)138,
531(z)26,
553(z)74,
554(z)22,
560(z)158
- shortest,
411(7)1013,
411(34)3042,
412(39)5205,
471(z)12,
510(z)1,
520(z)43,
522(z)44,
560(z)121