Last update: Sun Oct 15 02:56:11 MDT 2017
@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",
}