Entry Ghosh:1991:CSP from lncs1991.bib
Last update: Sun Jun 12 02:46:39 2016
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{Ghosh:1991:CSP,
author = "Subir Kumar Ghosh and Anil Maheshwari and Sudebkumar
Prasant Pal and Sanjeev Saluja and C. E. Veni
Madhavan",
title = "Computing the Shortest Path Tree in a Weak Visibility
Polygon",
journal = j-LECT-NOTES-COMP-SCI,
volume = "560",
pages = "369--??",
year = "1991",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Mon May 13 08:51:55 MDT 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/lncs1991.bib",
acknowledgement = ack-nhfb,
}
Related entries
- Computing,
497(0)33,
497(0)535,
503(0)99,
505(0)25,
505(0)34,
507(0)350,
508(0)222,
510(0)127,
510(0)327,
510(0)649,
510(0)707,
519(0)54,
519(0)331,
519(0)412,
519(0)437,
525(0)381,
529(0)157,
532(0)549,
532(0)688,
536(0)129,
539(0)94,
547(0)281,
548(0)219,
553(0)203,
560(0)186,
563(0)63,
563(0)109,
563(0)233,
575(0)13,
576(0)377
- path,
496(0)381,
497(0)44,
497(0)169,
497(0)471,
508(0)180,
510(0)314,
510(0)327,
511(0)256,
519(0)189,
519(0)320,
519(0)331,
529(0)136,
531(0)76,
542(0)570,
553(0)309,
557(0)151,
557(0)336,
566(0)312
- polygon,
497(0)102,
510(0)661,
519(0)202,
519(0)249,
519(0)367,
519(0)412,
539(0)368,
553(0)203,
557(0)151,
557(0)176
- Shortest,
497(0)169,
510(0)327,
510(0)649,
519(0)412,
553(0)103,
557(0)163
- tree,
496(0)124,
497(0)55,
497(0)66,
497(0)111,
497(0)117,
497(0)127,
497(0)312,
497(0)335,
497(0)347,
497(0)484,
507(0)29,
507(0)161,
507(0)192,
507(0)329,
510(0)186,
510(0)707,
519(0)32,
519(0)105,
519(0)228,
519(0)299,
519(0)392,
519(0)400,
519(0)461,
520(0)367,
523(0)427,
525(0)183,
525(0)401,
528(0)419,
529(0)136,
529(0)190,
529(0)350,
529(0)370,
530(0)282,
531(0)44,
532(0)311,
532(0)520,
533(0)1,
553(0)249,
555(0)192,
555(0)243,
557(0)241,
565(0)509,
575(0)214
- Visibility,
497(0)323,
519(0)425,
519(0)437,
528(0)63,
553(0)277