Entry Srinivasan:1991:EAM 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{Srinivasan:1991:EAM,
author = "A. Srinivasan and C. P. Rangan",
title = "Efficient algorithms for the minimum weighted
dominating clique problem on permutation graphs",
journal = j-THEOR-COMP-SCI,
volume = "91",
number = "1",
pages = "1--21",
day = "09",
month = dec,
year = "1991",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:24:22 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory)",
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 = "algorithms; computational complexity; dominating
clique; EREW PRAM algorithm; minimum weighted
dominating clique problem; parallel algorithms;
permutation graphs; space complexity; vertices",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- C4240P,
88(1)59,
88(2)191,
90(1)127,
90(1)151,
90(1)171,
90(1)185,
91(2)129,
91(2)205,
91(2)239,
92(1)3,
92(1)19,
92(1)33,
92(1)87,
92(1)107,
92(1)145,
92(1)165,
92(1)191,
92(1)z,
92(2)301,
92(2)309,
92(2)319,
93(2)169,
93(2)245,
94(1)141,
94(2)237,
94(2)335,
95(1)169,
95(2)207,
95(2)231,
95(2)245,
95(2)323,
96(1)157,
96(1)217,
96(2)305,
96(2)345,
96(2)411,
97(1)1,
97(1)67,
97(1)105,
97(1)131,
98(2)249,
98(2)263,
99(2)279,
99(2)335,
100(1)1,
100(1)45,
100(1)105,
100(1)157,
100(1)185,
100(1)205,
100(1)253,
100(2)365,
101(1)133,
101(2)177,
101(2)289,
101(2)337,
102(1)1,
102(1)135,
102(1)165,
102(1)185,
102(2)355,
104(2)207,
104(2)285,
106(2)361,
107(1)77,
108(2)291,
108(2)331,
112(1)5,
114(1)31,
114(1)63,
114(1)119,
114(1)173,
114(1)z,
120(2)261,
120(2)303,
125(1)3,
125(2)373,
127(1)53,
127(1)99,
127(1)123,
127(1)181,
128(1)75,
129(2)293,
130(1)49,
130(1)175,
131(1)139,
132(1)403,
134(2)493,
135(1)5,
135(2)171,
135(2)289,
135(2)377,
136(2)527
- clique,
134(1)209
- efficient,
71(1)95,
74(3)299,
76(2)223,
77(3)291,
78(1)245,
80(1)53,
91(1)57,
99(2)265,
106(1)21,
108(2)331,
116(1)195,
116(2)305,
119(2)247,
129(2)293,
130(1)203,
133(2)361,
134(2)493
- EREW,
86(2)243,
87(2)251
- minimum,
99(2)335,
100(1)105,
100(1)223,
103(1)107,
106(2)265,
136(2)507
- permutation,
85(1)171,
88(1)83,
95(2)263,
102(2)253,
108(1)119,
115(2)351,
117(1)153,
117(1)243,
117(1)303,
125(2)205,
126(2)281,
131(2)449,
135(2)289
- PRAM,
73(3)319,
81(2)311,
86(2)243,
87(2)251,
92(1)87,
93(2)245,
95(2)323,
99(2)335,
100(1)1,
106(2)361,
107(1)121,
116(2)421,
127(1)53,
128(1)3,
129(2)293,
132(1)403,
134(2)493
- space,
70(1)159,
70(2)233,
71(3)347,
73(1)1,
74(1)115,
74(2)183,
74(3)273,
75(1)15,
75(1)85,
76(2)179,
77(3)221,
80(2)289,
82(1)1,
82(1)165,
85(2)353,
86(1)3,
87(1)1,
87(1)43,
88(1)83,
92(1)3,
92(1)33,
92(1)87,
93(1)143,
93(2)201,
94(2)175,
95(2)231,
95(2)245,
96(1)157,
96(1)z,
96(2)411,
97(2)183,
99(1)121,
101(1)99,
101(2)239,
103(2)283,
110(1)99,
111(1)89,
111(1)103,
111(1)191,
111(1)z,
113(2)191,
114(2)273,
119(1)63,
123(1)139,
124(1)1,
124(2)195,
124(2)343,
125(2)295,
125(2)345,
125(2)355,
127(1)171,
127(2)199,
129(2)397,
130(1)85,
130(1)203,
132(1)319,
133(1)49,
134(1)131,
134(2)529,
135(2)171
- vertex,
72(1)65,
74(1)19,
74(3)299,
84(2)179,
86(2)205,
90(2)355,
97(2)285,
99(2)213,
103(1)107,
112(2)419,
115(2)351,
126(1)53,
130(1)175,
131(2)361,
132(1)337,
134(1)209
- weighted,
73(3)319,
75(1)157,
75(1)z,
79(1)179,
99(2)335,
108(2)371,
119(1)39,
119(1)z,
127(2)255,
130(1)85,
130(1)101,
130(1)125