Entry Srikant:1993:OPC from tcs1990.bib
Last update: Wed Sep 26 02:11:46 MDT 2018
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{Srikant:1993:OPC,
author = "R. Srikant and Ravi Sundaram and Karan Sher Singh and
C. Pandu Rangan",
title = "Optimal path cover problem on block graphs and
bipartite permutation graphs",
journal = j-THEOR-COMP-SCI,
volume = "115",
number = "2",
pages = "351--357",
day = "19",
month = jul,
year = "1993",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:17:23 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1993&volume=115&issue=2;
http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1993&volume=115&issue=2&aid=1372",
acknowledgement = ack-nhfb,
classification = "C4240 (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 = "bipartite permutation graphs; block graphs;
computational complexity; computational geometry;
linear-time algorithms; NP-completeness; optimal path
cover problem; vertex disjoint paths",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- bipartite,
102(2)283,
106(2)309,
110(1)197,
112(2)371,
123(2)329,
127(2)255,
131(2)361
- block,
74(1)3,
85(2)283,
95(1)43,
113(2)293
- C4260,
88(2)231,
92(2)319,
94(2)295,
98(2)263,
103(1)107,
106(2)265,
112(2)215,
112(2)339,
115(2)291,
116(2)291,
116(2)359,
116(2)373,
117(1)153,
117(1)187,
117(1)203,
119(2)331,
123(1)151,
123(1)z,
127(1)187,
129(2)263,
129(2)369,
130(1)125,
130(1)139,
130(1)163,
131(2)361,
134(2)415
- completeness, NP-,
134(2)387
- cover,
84(2)179,
86(2)377,
95(1)159,
133(1)49
- disjoint,
76(1)53,
83(2)275,
91(2)239,
102(2)283,
103(1)107,
117(1)187,
124(2)195,
126(1)31,
127(2)395,
129(2)369,
133(1)49,
134(1)225,
136(2)333
- geometry,
74(1)95,
74(3)253,
81(2)289,
84(1)77,
84(1)127,
86(2)205,
88(2)231,
92(2)319,
94(2)295,
98(2)263,
103(1)107,
106(2)265,
112(2)215,
112(2)339,
113(2)371,
115(2)291,
116(2)291,
116(2)359,
116(2)373,
117(1)153,
117(1)187,
117(1)203,
119(2)331,
123(1)151,
123(1)z,
127(1)187,
129(2)263,
129(2)369,
130(1)125,
130(1)139,
130(1)163,
131(2)361,
134(1)131,
134(2)415
- linear-time,
92(1)77,
92(1)119,
99(2)213,
120(2)169,
123(1)151,
123(2)273,
126(1)77
- NP-completeness,
134(2)387
- optimal,
71(3)401,
74(1)95,
74(2)183,
76(1)93,
76(2)331,
77(3)291,
80(1)105,
81(2)257,
82(1)113,
82(1)157,
84(1)127,
84(2)179,
85(1)155,
86(2)365,
87(2)251,
92(1)33,
92(1)87,
92(1)z,
93(2)245,
106(2)361,
108(2)271,
111(1)191,
119(2)355,
120(2)197,
120(2)261,
123(2)377,
125(1)91,
127(2)395,
128(1)179,
129(2)323,
130(1)17,
132(1)403,
134(2)263,
134(2)559
- path,
72(2)251,
72(2)z,
74(2)199,
74(3)355,
79(1)151,
79(1)179,
83(2)189,
84(1)127,
84(2)179,
84(2)281,
88(1)33,
88(1)151,
89(1)33,
94(1)141,
95(2)245,
100(1)243,
102(2)329,
105(1)129,
106(2)391,
112(2)255,
116(2)359,
117(1)137,
117(1)187,
117(1)203,
125(2)345,
127(2)395,
131(1)1,
133(1)65
- permutation,
85(1)171,
88(1)83,
91(1)1,
95(2)263,
102(2)253,
108(1)119,
117(1)153,
117(1)243,
117(1)303,
125(2)205,
126(2)281,
131(2)449,
135(2)289
- time, linear-,
92(1)77,
92(1)119,
99(2)213,
120(2)169,
123(1)151,
123(2)273,
126(1)77
- vertex,
72(1)65,
74(1)19,
74(3)299,
84(2)179,
86(2)205,
90(2)355,
91(1)1,
97(2)285,
99(2)213,
103(1)107,
112(2)419,
126(1)53,
130(1)175,
131(2)361,
132(1)337,
134(1)209