Entry Takaoka:1998:SPA from tcs1995.bib
Last update: Sun Oct 15 02:56:11 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{Takaoka:1998:SPA,
author = "Tadao Takaoka",
title = "Shortest path algorithms for nearly acyclic directed
graphs",
journal = j-THEOR-COMP-SCI,
volume = "203",
number = "1",
pages = "143--150",
day = "06",
month = aug,
year = "1998",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:21:59 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1998&volume=203&issue=1;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cas/tree/store/tcs/sub/1998/203/1/2826.pdf",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
Related entries
- acyclic,
159(2)343,
178(1)129,
179(1)203
- directed,
127(2)287,
143(1)73,
151(2)385,
152(1)67,
154(2)247,
154(2)379,
157(2)215,
158(1)81,
158(1)343,
159(1)65,
159(1)129,
159(2)343,
168(1)121,
171(1)3,
174(1)97,
175(2)393,
178(1)103,
178(1)129,
194(1)207,
194(1)246,
221(1)119
- nearly,
174(1)193
- path,
139(1)355,
140(2)205,
140(2)231,
140(2)249,
140(2)265,
140(2)291,
140(2)301,
142(2)179,
142(2)277,
143(1)175,
143(2)343,
145(1)27,
145(1)45,
145(1)111,
145(1)147,
145(1)329,
157(1)53,
157(1)101,
159(1)65,
160(1)87,
161(1)1,
166(1)49,
168(1)121,
175(1)127,
176(1)67,
183(1)21,
186(1)171,
188(1)1,
190(1)41,
196(1)395,
203(2)205,
208(1)33,
215(1)89,
225(1)163
- shortest,
140(2)265,
140(2)291,
143(1)113,
143(2)343,
143(2)353,
144(1)161,
145(1)317,
161(1)123,
168(1)121,
172(1)303,
182(1)183,
186(1)171,
191(1)205,
203(2)205,
207(1)105,
209(1)287