Entry Teng:1995:ISV 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{Teng:1995:ISV,
author = "Shang-Hua Teng",
title = "Independent sets versus perfect matchings",
journal = j-THEOR-COMP-SCI,
volume = "145",
number = "1--2",
pages = "381--390",
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=1923",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240P (Parallel
programming and algorithm theory); C4260 (Computational
geometry)",
corpsource = "Sch. of Comput. Sci., Carnegie Mellon Univ.,
Pittsburgh, PA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "bipartite graph; computational geometry; implicitly
represented large-scale graphs; independent sets; NC
algorithm; parallel algorithms; perfect matchings;
polynomial time random matching algorithm; random walk;
structural relationships; uniform random perfect
matching",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- bipartite,
147(1)69,
147(1)267,
148(1)93,
159(1)105,
159(1)137,
175(2)337
- 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,
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
- independent,
148(1)57,
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
- large-scale,
162(1)151,
173(1)49
- matching,
137(2)269,
141(1)53,
145(1)111,
147(1)19,
154(2)203,
154(2)225,
155(2)321,
156(1)217,
158(1)177,
159(1)105,
160(1)217,
161(1)1,
161(1)123,
163(1)117,
164(1)73,
164(1)299,
172(1)281,
173(2)349,
177(2)425,
178(1)129,
180(1)115,
180(1)203,
181(1)159,
185(2)347,
191(1)205,
197(1)247-2,
198(1)1,
201(1)263,
201(1)281,
212(1)101,
220(2)469
- NC,
141(1)337,
143(2)309,
148(1)57,
148(2)183,
157(1)79,
215(1)89
- perfect,
143(2)319,
145(1)111,
158(1)343,
164(1)253,
174(1)217,
182(1)1,
197(1)247-2
- random,
143(1)73,
144(1)67,
144(1)125,
144(1)277,
147(1)267,
148(1)19,
152(2)171,
152(2)219,
154(1)23,
156(1)301,
159(1)5,
159(1)29,
159(1)43,
162(1)151,
162(2)341,
164(1)107,
169(2)147,
175(2)393,
178(1)155,
190(2)151,
191(1)185,
196(1)3,
196(1)109,
201(1)281,
207(2)343,
207(2)387,
215(1)1,
218(2)219,
218(2)233,
218(2)263,
219(1)287,
226(1)29,
229(1)103
- relationship,
140(2)249,
149(1)179,
153(1)211,
156(1)71,
157(2)227,
164(1)41,
165(2)463,
188(1)79
- represented,
208(1)149
- scale, large-,
162(1)151,
173(1)49
- structural,
146(1)25,
146(1)109,
149(1)3,
155(1)179,
158(1)361,
162(1)5,
164(1)123,
177(1)73,
188(1)1,
211(1)311
- uniform,
142(2)257,
144(1)67,
144(1)161,
145(1)111,
147(1)149,
151(1)277,
163(1)117,
180(1)17,
180(1)229,
183(2)187,
184(1)237,
188(1)231,
194(1)163,
196(1)259,
196(1)395,
203(1)69,
206(1)219,
218(2)233,
219(1)301,
220(1)67,
221(1)457
- versus,
153(1)171,
154(1)23,
164(1)141,
170(1)145
- walk,
161(1)289,
169(2)147,
187(1)179,
187(1)z,
218(2)249