Entry Shoudai:1995:UMI 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{Shoudai:1995:UMI,
author = "Takayoshi Shoudai and Satoru Miyano",
title = "Using maximal independent sets to solve problems in
parallel",
journal = j-THEOR-COMP-SCI,
volume = "148",
number = "1",
pages = "57--65",
day = "21",
month = aug,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:19:18 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=148&issue=1;
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=148&issue=1&aid=1855",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240C
(Computational complexity); C4240P (Parallel
programming and algorithm theory); C4260 (Computational
geometry)",
corpsource = "Lab. of Comput. Sci., Kyushu Univ., Fukuoka, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; computational geometry;
hereditary graph property; maximal independent sets;
maximal vertex-induced subgraph; NC algorithm; parallel
algorithms",
pubcountry = "Netherlands",
treatment = "P Practical; 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)27,
145(1)241,
145(1)329,
145(1)381,
147(1)211,
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
- independent,
145(1)381,
148(1)93,
148(1)133,
158(1)117,
162(1)151,
164(1)107,
167(1)171,
168(1)105,
169(1)39,
172(1)67,
174(1)23,
178(1)265,
190(2)167,
192(2)233,
204(1)119,
223(1)87
- maximal,
143(2)309,
145(1)317,
146(1)331,
147(1)19,
161(1)1,
166(1)83,
175(2)257,
181(1)91,
183(1)3,
188(1)231,
191(1)117,
193(1)53,
204(1)11,
215(1)89,
218(1)107,
218(2)273
- Miyano, Satoru,
161(1)289,
210(2)261
- NC,
141(1)337,
143(2)309,
145(1)381,
148(2)183,
157(1)79,
215(1)89
- solve,
145(1)189
- subgraph,
145(1)111,
145(1)147,
161(1)307,
164(1)287,
168(1)121,
172(1)209,
172(1)265,
181(1)91,
181(2)307,
203(1)91,
205(1)85,
205(1)261
- using,
140(1)95,
142(2)299,
145(1)189,
158(1)1,
170(1)245,
173(1)253,
178(1)1,
178(1)119,
185(1)47,
187(1)249,
194(1)241,
194(1)246,
196(1)241,
199(1)145,
200(1)261,
205(1)307,
210(2)305,
218(2)233,
220(1)3,
220(1)31,
220(2)377,
222(1)153