Entry Lingas:1997:MTP 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{Lingas:1997:MTP,
author = "Andrzej Lingas",
title = "Maximum tree-packing in time {$O(n^5/2)$}",
journal = j-THEOR-COMP-SCI,
volume = "181",
number = "2",
pages = "307--316",
day = "30",
month = jul,
year = "1997",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:21:03 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1997&volume=181&issue=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=1997&volume=181&issue=2&aid=2478",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240C
(Computational complexity)",
conflocation = "Xi'an, China; 24-26 Aug. 1995",
conftitle = "First Annual International Computing and Combinatorics
Conference",
corpsource = "Dept. of Comput. Sci., Lund Univ., Sweden",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "asymptotic bounds; computational complexity; graph
theory; maximum tree-packing; node-disjoint subtrees;
subgraph homeomorphism; subgraph isomorphism; time
O(n/sup 5/2/); topological imbedding; trees
(mathematics)",
pubcountry = "Netherlands",
sponsororg = "Nat. Natural Sci. Found.; Xi'an Jiaotong Univ.;
Chinese Acad. Sci",
treatment = "T Theoretical or Mathematical",
}
Related entries
- asymptotic,
143(2)343,
144(1)3,
144(1)101,
144(1)161,
144(1)277,
147(1)31,
147(1)267,
149(1)67,
156(1)301,
159(1)65,
164(1)185,
164(1)277,
187(1)81,
187(1)263,
190(2)151,
215(1)371,
218(2)249
- bound,
139(1)355,
140(2)265,
140(2)301,
141(1)175,
143(2)335,
145(1)45,
145(1)271,
148(1)141,
151(1)163,
154(1)107,
154(2)165,
154(2)283,
155(2)411,
156(1)99,
156(1)315,
157(1)129,
157(2)139,
157(2)161,
157(2)185,
157(2)259,
158(1)143,
161(1)301,
162(2)341,
163(1)177,
165(2)247,
168(1)105,
172(1)1,
172(1)293,
175(2)283,
175(2)373,
179(1)251,
179(1)301,
180(1)243,
181(1)45,
181(1)119,
184(1)61,
185(1)47,
188(1)59,
188(1)117,
192(1)3,
194(1)163,
196(1)153,
197(1)95,
197(1)245-2,
201(1)63,
205(1)297,
209(1)47,
209(1)141,
209(1)389,
212(1)3
- isomorphism,
139(1)187,
145(1)189,
145(1)329,
152(1)67,
155(1)267,
164(1)287,
180(1)17,
197(1)242-3,
197(1)247
- Lingas, Andrzej,
141(1)337,
174(1)193
- maximum,
140(2)301,
145(1)357,
147(1)181,
148(1)165,
150(1)1,
158(1)117,
164(1)277,
174(1)23,
181(1)91,
181(1)107,
191(1)193,
196(1)201
- subgraph,
145(1)111,
145(1)147,
148(1)57,
161(1)307,
164(1)287,
168(1)121,
172(1)209,
172(1)265,
181(1)91,
203(1)91,
205(1)85,
205(1)261
- subtrees,
167(1)171,
181(1)181
- topological,
146(1)331,
147(1)137,
147(1)211,
151(1)29,
151(1)79,
151(1)257,
151(1)277,
163(1)161,
166(1)263,
167(1)73,
174(1)203,
175(1)3,
177(1)139,
179(1)319,
191(1)79,
219(1)347,
219(1)379,
221(1)157