Entry Srikrishna:1995:OPA 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{Srikrishna:1995:OPA,
author = "G. Srikrishna and C. {Pandu Rangan}",
title = "Optimal parallel algorithms for path problems on
planar graphs",
journal = j-THEOR-COMP-SCI,
volume = "145",
number = "1--2",
pages = "27--43",
day = "10",
month = jul,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:19:12 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=145&issue=1-2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=145&issue=1-2&aid=1823",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C4260 (Computational geometry)",
corpsource = "Dept. of Comput. Sci. and Eng., Indian Inst. of
Technol., Madras, India",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "all-bidirectional-edges; biconnected planar graph;
bridges; computational geometry; disjoint problem; edge
labeling; optimal parallel algorithms; parallel
algorithms; path problems; planar graphs; vertices",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- C4260,
137(1)145,
137(2)177,
140(2)205,
140(2)249,
140(2)265,
140(2)291,
140(2)301,
141(1)337,
143(1)113,
143(1)175,
143(2)189,
143(2)309,
143(2)343,
145(1)241,
145(1)329,
145(1)381,
147(1)211,
148(1)57,
148(1)93,
151(1)257,
155(2)321,
156(1)1,
156(1)159,
157(1)35,
157(1)53,
157(1)z,
157(2)185,
159(1)103,
159(1)105,
159(1)129,
159(1)137,
162(2)351,
163(1)303,
164(1)59,
164(1)165,
168(1)121,
169(2)147,
172(1)121,
172(1)175,
172(1)209,
172(1)233,
172(1)265,
174(1)193,
175(2)239,
180(1)363,
181(1)3,
181(1)57,
181(1)91,
181(1)107,
182(1)233,
186(1)1,
188(1)59,
188(1)129,
191(1)193,
194(1)z,
197(1)203
- disjoint,
140(2)205,
142(2)229,
154(2)165,
165(1)97,
192(1)107
- edge,
161(1)289,
164(1)59,
172(1)175,
174(1)137,
203(1)91,
203(2)225,
209(1)331,
211(1)375
- labeling,
159(2)191,
172(1)175
- optimal,
143(1)73,
143(1)123,
147(1)1,
154(2)283,
154(2)367,
156(1)177,
157(2)161,
157(2)215,
159(2)191,
162(2)323,
163(1)239,
164(1)107,
164(1)299,
165(2)441,
166(1)221,
168(2)367,
172(1)265,
174(1)193,
178(1)225,
180(1)243,
180(1)309,
182(1)217,
185(2)347,
188(1)1,
188(1)221,
196(1)3,
196(1)395,
197(1)189,
197(1)203,
197(1)242-2,
200(1)261,
203(2)205,
205(1)243,
210(2)341,
215(1)69,
220(2)363,
221(1)119,
222(1)113,
225(1)163,
227(1)79
- 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)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(1)143,
203(2)205,
208(1)33,
215(1)89,
225(1)163
- planar,
140(2)301,
143(2)309,
147(1)69,
154(1)3,
159(1)137,
172(1)303,
175(2)239,
181(1)57,
203(1)123,
215(1)225
- vertex,
140(2)265,
147(1)249,
154(2)247,
157(2)161,
158(1)117,
172(1)233,
172(1)265,
174(1)23,
174(1)193,
175(2)239,
225(1)113