An Asymptotic Analysis of Labeled and Unlabeled k-Trees

In this paper we provide a systematic treatment of several shape parameters of (random) k -trees. Our research is motivated by many important algorithmic applications of k -trees in the context of tree-decomposition of a graph and graphs of bounded tree-width. On the other hand, k -trees are also a...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Algorithmica Jg. 75; H. 4; S. 579 - 605
Hauptverfasser:	Drmota, Michael, Jin, Emma Yu
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.08.2016
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Mathematics of Computing Theory of Computation Central limit theorem Generating function Singularity analysis 05A16 trees 05A15
ISSN:	0178-4617, 1432-0541
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Abstract	In this paper we provide a systematic treatment of several shape parameters of (random) k -trees. Our research is motivated by many important algorithmic applications of k -trees in the context of tree-decomposition of a graph and graphs of bounded tree-width. On the other hand, k -trees are also a very interesting object from the combinatorial point of view. For both labeled and unlabeled k -trees, we prove that the number of leaves and more generally the number of nodes of given degree satisfy a central limit theorem with mean value and variance that are asymptotically linear in the size of the k -tree. In particular we solve the asymptotic counting problem for unlabeled k -trees. By applying a proper singularity analysis of generating functions we show that the numbers U k ( n ) of unlabeled k -trees of size n are asymptotically given by U k ( n ) ∼ c k n - 5 / 2 ρ k - n , where c k > 0 and ρ k > 0 denotes the radius of convergence of the generating function U ( z ) = ∑ n ≥ 0 U k ( n ) z n .
AbstractList	In this paper we provide a systematic treatment of several shape parameters of (random) k -trees. Our research is motivated by many important algorithmic applications of k -trees in the context of tree-decomposition of a graph and graphs of bounded tree-width. On the other hand, k -trees are also a very interesting object from the combinatorial point of view. For both labeled and unlabeled k -trees, we prove that the number of leaves and more generally the number of nodes of given degree satisfy a central limit theorem with mean value and variance that are asymptotically linear in the size of the k -tree. In particular we solve the asymptotic counting problem for unlabeled k -trees. By applying a proper singularity analysis of generating functions we show that the numbers U k ( n ) of unlabeled k -trees of size n are asymptotically given by U k ( n ) ∼ c k n - 5 / 2 ρ k - n , where c k > 0 and ρ k > 0 denotes the radius of convergence of the generating function U ( z ) = ∑ n ≥ 0 U k ( n ) z n .
Author	Jin, Emma Yu Drmota, Michael
Author_xml	– sequence: 1 givenname: Michael surname: Drmota fullname: Drmota, Michael organization: Institut für Diskrete Mathematik und Geometrie, TU Wien – sequence: 2 givenname: Emma Yu surname: Jin fullname: Jin, Emma Yu email: yu.jin@tuwien.ac.at, jin@cs.uni-kl.de organization: Institut für Diskrete Mathematik und Geometrie, TU Wien
BookMark	eNp9kMtqwzAQRUVJoU7aD-jOP6B2xpYse2lCHwFDN8layLJUnDpSkNyF_74OzqqLrIbLcOZyZk1WzjtDyDPCCwKI1wjAeE4BOQXIK4p3JEGWZxQ4wxVJAEVJWYHigaxjPAJgJqoiIaJ2aR2n03n0Y6_T2qlhin1MvU0b1ZrBdKlyXXpwwzX90H0wJj6Se6uGaJ6uc0MO72_77Sdtvj5227qhOivLkeaFLUuRWWyha0EJ5EVlDcuhEiyrLG-50Ux0musSeGu50LwDnBeVsoW1PN8QXO7q4GMMxspz6E8qTBJBXszlYi5nc3kxlzgz4h-j-1GNvXdjUP1wk8wWMs4t7tsEefS_Yf5JvAH9ARKZbcs
CitedBy_id	crossref_primary_10_1002_rsa_20802 crossref_primary_10_1007_s40590_024_00697_2 crossref_primary_10_1016_j_ejc_2018_02_030 crossref_primary_10_1017_S0963548320000164
Cites_doi	10.1002/(SICI)1097-0118(199907)31:3<227::AID-JGT6>3.0.CO;2-6 10.1007/3-540-57155-8_284 10.1007/978-3-540-85221-6 10.1007/978-3-642-10217-2_19 10.1214/11-AOP686 10.1112/S002557930000245X 10.1016/S0021-9800(69)80120-1 10.1016/j.jcta.2014.05.002 10.1016/0095-8956(83)90079-5 10.1016/j.jcta.2004.01.009 10.1006/aama.2001.0771 10.1016/0890-5401(90)90043-H 10.1016/0012-365X(75)90076-X 10.1016/S0021-9800(69)80119-5 10.1007/BF01934985 10.1016/0012-365X(71)90023-9 10.1137/100790161 10.2307/1969046 10.1016/0166-218X(89)90031-0 10.1214/aop/1176989404 10.1016/0097-3165(73)90016-2 10.37236/2615 10.1016/B978-0-444-88074-1.50010-X
ContentType	Journal Article
Copyright	Springer Science+Business Media New York 2015
Copyright_xml	– notice: Springer Science+Business Media New York 2015
DBID	AAYXX CITATION
DOI	10.1007/s00453-015-0039-1
DatabaseName	CrossRef
DatabaseTitle	CrossRef
DatabaseTitleList
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science
EISSN	1432-0541
EndPage	605
ExternalDocumentID	10_1007_s00453_015_0039_1
GrantInformation_xml	– fundername: Austrian Science Fund grantid: Project F50-02 funderid: http://dx.doi.org/10.13039/501100002428 – fundername: German Research Foundation DFG grantid: Project JI 207/1-1
GroupedDBID	-4Z -59 -5G -BR -EM -Y2 -~C -~X .86 .DC .VR 06D 0R~ 0VY 199 1N0 1SB 203 23M 28- 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 78A 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDPE ABDZT ABECU ABFSI ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABLJU ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTAH ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AI. AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. BA0 BBWZM BDATZ BGNMA BSONS CAG COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP E.L EBLON EBS EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ H~9 I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KDC KOV KOW LAS LLZTM M4Y MA- N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P9O PF- PT4 PT5 QOK QOS R4E R89 R9I RHV RIG RNI RNS ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TN5 TSG TSK TSV TUC U2A UG4 UOJIU UQL UTJUX UZXMN VC2 VFIZW VH1 VXZ W23 W48 WK8 YLTOR Z45 Z7X Z83 Z88 Z8R Z8W Z92 ZMTXR ZY4 ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEZWR AFDZB AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION
ID	FETCH-LOGICAL-c288t-36f8872f1b0db0a71569fe43097429f5b5ec47dc5c805bf57c5d019f59af6ff53
IEDL.DBID	RSV
ISICitedReferencesCount	6
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000377359000002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0178-4617
IngestDate	Tue Nov 18 22:08:46 EST 2025 Sat Nov 29 02:20:27 EST 2025 Fri Feb 21 02:40:22 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	4
Keywords	Central limit theorem Generating function Singularity analysis 05A16 trees 05A15
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c288t-36f8872f1b0db0a71569fe43097429f5b5ec47dc5c805bf57c5d019f59af6ff53
PageCount	27
ParticipantIDs	crossref_primary_10_1007_s00453_015_0039_1 crossref_citationtrail_10_1007_s00453_015_0039_1 springer_journals_10_1007_s00453_015_0039_1
PublicationCentury	2000
PublicationDate	20160800 2016-8-00
PublicationDateYYYYMMDD	2016-08-01
PublicationDate_xml	– month: 8 year: 2016 text: 20160800
PublicationDecade	2010
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	Algorithmica
PublicationTitleAbbrev	Algorithmica
PublicationYear	2016
Publisher	Springer US
Publisher_xml	– name: Springer US
References	Beineke, Pippert (CR4) 1969; 6 Darrasse, Soria (CR8) 2009; 5874 Robinson, Schwenk (CR26) 1975; 12 Flajolet, Sedgewick (CR12) 2010 Bertele, Brioschi (CR5) 1973; 14 Drmota, Gittenberger (CR10) 1999; 31 Gainer-Dewar (CR15) 2012; 19 Fowler, Gessel, Labelle, Leroux (CR14) 2002; 28 Foata (CR13) 1971; 1 Haas, Miermont (CR18) 2012; 40 Grötschel, Katona (CR17) 2008 Telle, Proskurowski (CR28) 1993; 709 Arnborg (CR2) 1985; 25 Drmota (CR9) 2008 CR6 Labelle, Lamathe, Leroux (CR22) 2004; 106 Gessel, Gainer-Dewar (CR16) 2014; 126 CR25 Courcelle (CR7) 1990; 85 CR21 Robertson, Seymour (CR27) 1983; 35 Arnborg, Proskurowski (CR3) 1989; 23 Harary, Palmer (CR19) 1968; 15 Moon (CR23) 1969; 6 Otter (CR24) 1948; 49 Drmota, Fusy, Kang, Kraus, Rue (CR11) 2011; 25 Aldous (CR1) 1993; 21 Harary, Palmer (CR20) 1973 F Harary (39_CR19) 1968; 15 RW Robinson (39_CR26) 1975; 12 D Aldous (39_CR1) 1993; 21 M Grötschel (39_CR17) 2008 B Haas (39_CR18) 2012; 40 N Robertson (39_CR27) 1983; 35 P Flajolet (39_CR12) 2010 U Bertele (39_CR5) 1973; 14 A Gainer-Dewar (39_CR15) 2012; 19 LW Beineke (39_CR4) 1969; 6 39_CR25 39_CR6 G Labelle (39_CR22) 2004; 106 39_CR21 T Fowler (39_CR14) 2002; 28 S Arnborg (39_CR3) 1989; 23 M Drmota (39_CR11) 2011; 25 F Harary (39_CR20) 1973 B Courcelle (39_CR7) 1990; 85 D Foata (39_CR13) 1971; 1 M Drmota (39_CR10) 1999; 31 S Arnborg (39_CR2) 1985; 25 IM Gessel (39_CR16) 2014; 126 M Drmota (39_CR9) 2008 R Otter (39_CR24) 1948; 49 JA Telle (39_CR28) 1993; 709 A Darrasse (39_CR8) 2009; 5874 JW Moon (39_CR23) 1969; 6
References_xml	– volume: 31 start-page: 227 issue: 3 year: 1999 end-page: 253 ident: CR10 article-title: The distribution of nodes of given degree in random trees publication-title: J. Graph Theory doi: 10.1002/(SICI)1097-0118(199907)31:3<227::AID-JGT6>3.0.CO;2-6 – volume: 19 start-page: P45 issue: 4 year: 2012 ident: CR15 article-title: -species and the enumeration of -trees publication-title: Electron. J. Comb. – volume: 709 start-page: 610 year: 1993 end-page: 621 ident: CR28 article-title: Practical algorithms on partial -trees with an application to domination-like problems publication-title: Algorithms Data Struct. Lect. Notes Comput. Sci. doi: 10.1007/3-540-57155-8_284 – year: 2008 ident: CR17 publication-title: Building Bridges: Between Mathematics and Computer Science, Bolyai Society Mathematical Studies doi: 10.1007/978-3-540-85221-6 – volume: 5874 start-page: 170 year: 2009 end-page: 182 ident: CR8 article-title: Limiting distribution for distances in -trees publication-title: Comb. Algorithms Lect. Notes Comput. Sci. doi: 10.1007/978-3-642-10217-2_19 – volume: 40 start-page: 2299 issue: 6 year: 2012 end-page: 2706 ident: CR18 article-title: Scaling limits of Markov branching trees with applications to Galton–Watson and random unordered trees publication-title: Ann. Probab. doi: 10.1214/11-AOP686 – volume: 15 start-page: 115 year: 1968 end-page: 122 ident: CR19 article-title: On acyclic simplicial complexes publication-title: Mathematika doi: 10.1112/S002557930000245X – year: 2008 ident: CR9 publication-title: Random Trees: An Interplay Between Combinatorics and Probability – volume: 6 start-page: 200 issue: 2 year: 1969 end-page: 205 ident: CR4 article-title: The number of labeled k-dimensional trees publication-title: J. Comb. Theory A doi: 10.1016/S0021-9800(69)80120-1 – ident: CR6 – volume: 126 start-page: 177 year: 2014 end-page: 193 ident: CR16 article-title: Counting unlabeled -trees publication-title: J. Comb. Theory A doi: 10.1016/j.jcta.2014.05.002 – volume: 35 start-page: 39 year: 1983 end-page: 61 ident: CR27 article-title: Graph minors. I. Excluding a forest publication-title: J. Comb. Theory B doi: 10.1016/0095-8956(83)90079-5 – volume: 106 start-page: 193 year: 2004 end-page: 219 ident: CR22 article-title: Labelled and unlabelled enumeration of k-gonal 2-trees publication-title: J. Comb. Theory A doi: 10.1016/j.jcta.2004.01.009 – volume: 28 start-page: 145 year: 2002 end-page: 168 ident: CR14 article-title: The specification of 2-trees publication-title: Adv. Appl. Math. doi: 10.1006/aama.2001.0771 – ident: CR25 – volume: 85 start-page: 12 issue: 1 year: 1990 end-page: 75 ident: CR7 article-title: The monadic second-order logic of graphs I: recognizable sets of finite graphs publication-title: Inf. Comput. doi: 10.1016/0890-5401(90)90043-H – volume: 12 start-page: 359 year: 1975 end-page: 372 ident: CR26 article-title: The distribution of degrees in a large random tree publication-title: Discrete Math. doi: 10.1016/0012-365X(75)90076-X – ident: CR21 – volume: 6 start-page: 196 year: 1969 end-page: 199 ident: CR23 article-title: The number of labeled k-trees publication-title: J. Comb. Theory A doi: 10.1016/S0021-9800(69)80119-5 – volume: 25 start-page: 1 issue: 1 year: 1985 end-page: 23 ident: CR2 article-title: Efficient algorithms for combinatorial problems on graphs with bounded decomposability—a survey publication-title: BIT Numer. Math. doi: 10.1007/BF01934985 – volume: 1 start-page: 181 year: 1971 end-page: 186 ident: CR13 article-title: Enumerating k-trees publication-title: Discrete Math. doi: 10.1016/0012-365X(71)90023-9 – year: 2010 ident: CR12 publication-title: Analytic Combinatorics – year: 1973 ident: CR20 publication-title: Graphical Enumeration – volume: 25 start-page: 1615 year: 2011 end-page: 1651 ident: CR11 article-title: Asymptotic study of subcritical graph classes publication-title: SIAM J. Dicrete Math. doi: 10.1137/100790161 – volume: 49 start-page: 583 year: 1948 end-page: 599 ident: CR24 article-title: The number of trees publication-title: Ann. Math. doi: 10.2307/1969046 – volume: 23 start-page: 11 year: 1989 end-page: 24 ident: CR3 article-title: Linear time algorithms for NP-hard problems restricted to partial -trees publication-title: Discrete Appl. Math. doi: 10.1016/0166-218X(89)90031-0 – volume: 21 start-page: 248 issue: 1 year: 1993 end-page: 289 ident: CR1 article-title: The continuum random tree III publication-title: Ann. Probab. doi: 10.1214/aop/1176989404 – volume: 14 start-page: 137 issue: 2 year: 1973 end-page: 148 ident: CR5 article-title: On non-serial dynamic programming publication-title: J. Comb. Theory A doi: 10.1016/0097-3165(73)90016-2 – volume: 15 start-page: 115 year: 1968 ident: 39_CR19 publication-title: Mathematika doi: 10.1112/S002557930000245X – volume: 126 start-page: 177 year: 2014 ident: 39_CR16 publication-title: J. Comb. Theory A doi: 10.1016/j.jcta.2014.05.002 – volume: 14 start-page: 137 issue: 2 year: 1973 ident: 39_CR5 publication-title: J. Comb. Theory A doi: 10.1016/0097-3165(73)90016-2 – volume: 6 start-page: 200 issue: 2 year: 1969 ident: 39_CR4 publication-title: J. Comb. Theory A doi: 10.1016/S0021-9800(69)80120-1 – volume: 19 start-page: P45 issue: 4 year: 2012 ident: 39_CR15 publication-title: Electron. J. Comb. doi: 10.37236/2615 – volume: 12 start-page: 359 year: 1975 ident: 39_CR26 publication-title: Discrete Math. doi: 10.1016/0012-365X(75)90076-X – volume-title: Building Bridges: Between Mathematics and Computer Science, Bolyai Society Mathematical Studies year: 2008 ident: 39_CR17 doi: 10.1007/978-3-540-85221-6 – volume: 35 start-page: 39 year: 1983 ident: 39_CR27 publication-title: J. Comb. Theory B doi: 10.1016/0095-8956(83)90079-5 – volume: 5874 start-page: 170 year: 2009 ident: 39_CR8 publication-title: Comb. Algorithms Lect. Notes Comput. Sci. doi: 10.1007/978-3-642-10217-2_19 – ident: 39_CR6 doi: 10.1016/B978-0-444-88074-1.50010-X – volume: 31 start-page: 227 issue: 3 year: 1999 ident: 39_CR10 publication-title: J. Graph Theory doi: 10.1002/(SICI)1097-0118(199907)31:3<227::AID-JGT6>3.0.CO;2-6 – volume: 85 start-page: 12 issue: 1 year: 1990 ident: 39_CR7 publication-title: Inf. Comput. doi: 10.1016/0890-5401(90)90043-H – volume: 25 start-page: 1 issue: 1 year: 1985 ident: 39_CR2 publication-title: BIT Numer. Math. doi: 10.1007/BF01934985 – volume: 40 start-page: 2299 issue: 6 year: 2012 ident: 39_CR18 publication-title: Ann. Probab. doi: 10.1214/11-AOP686 – volume: 21 start-page: 248 issue: 1 year: 1993 ident: 39_CR1 publication-title: Ann. Probab. doi: 10.1214/aop/1176989404 – volume: 23 start-page: 11 year: 1989 ident: 39_CR3 publication-title: Discrete Appl. Math. doi: 10.1016/0166-218X(89)90031-0 – volume: 709 start-page: 610 year: 1993 ident: 39_CR28 publication-title: Algorithms Data Struct. Lect. Notes Comput. Sci. doi: 10.1007/3-540-57155-8_284 – volume: 6 start-page: 196 year: 1969 ident: 39_CR23 publication-title: J. Comb. Theory A doi: 10.1016/S0021-9800(69)80119-5 – volume-title: Graphical Enumeration year: 1973 ident: 39_CR20 – volume: 106 start-page: 193 year: 2004 ident: 39_CR22 publication-title: J. Comb. Theory A doi: 10.1016/j.jcta.2004.01.009 – volume-title: Random Trees: An Interplay Between Combinatorics and Probability year: 2008 ident: 39_CR9 – volume: 1 start-page: 181 year: 1971 ident: 39_CR13 publication-title: Discrete Math. doi: 10.1016/0012-365X(71)90023-9 – volume: 25 start-page: 1615 year: 2011 ident: 39_CR11 publication-title: SIAM J. Dicrete Math. doi: 10.1137/100790161 – volume: 49 start-page: 583 year: 1948 ident: 39_CR24 publication-title: Ann. Math. doi: 10.2307/1969046 – volume-title: Analytic Combinatorics year: 2010 ident: 39_CR12 – volume: 28 start-page: 145 year: 2002 ident: 39_CR14 publication-title: Adv. Appl. Math. doi: 10.1006/aama.2001.0771 – ident: 39_CR25 – ident: 39_CR21
SSID	ssj0012796
Score	2.1370409
Snippet	In this paper we provide a systematic treatment of several shape parameters of (random) k -trees. Our research is motivated by many important algorithmic...
SourceID	crossref springer
SourceType	Enrichment Source Index Database Publisher
StartPage	579
SubjectTerms	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Mathematics of Computing Theory of Computation
Title	An Asymptotic Analysis of Labeled and Unlabeled k-Trees
URI	https://link.springer.com/article/10.1007/s00453-015-0039-1
Volume	75
WOSCitedRecordID	wos000377359000002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1432-0541 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0012796 issn: 0178-4617 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1NSwMxEA1SPXixfmL9IgdPSmCbbprdYxGLh1IEW-ltSbIZEOu2dFfBf-9kmywUVNBjYLIsQ5I3j5l5Q8g1t9IiqiuWSsVZDDxmqosshYNRBlyiS9eS-SM5HiezWfro-7jLUO0eUpL1S900u7now9X-COYaShlSnm3hxGYcRX96blIHXNZDudzYeRYjPodU5nef2ASjzUxoDTDD9r9-bZ_s-XiSDtYH4IBs2eKQtMOsBuqv7hGRg4IOys-3ZbVASxq0SOgC6EhpxJ6cqiKn02LuV69ssrK2PCbT4f3k7oH5oQnM8CSpWK8P-G5w6Ooo15GSyM9SsHEPPYXQA0ILa2KZG2GSSGgQ0ogcwzwQqYI-gOidkFaxKOwpoZpDmmhhrBSANFNgbGmBp0qjnUKa1iFR8F5mvKK4G2wxzxot5NoxGTrGaZCmWbdDbpoty7Wcxm_Gt8Hdmb9Z5c_WZ3-yPie7GPr016V8F6RVrd7tJdkxH9VLubqqT9QXvNbC6A
linkProvider	Springer Nature
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3fS8MwEA4yBX1x_sT5Mw8-KYEua5b2cYhjYh2Cm-ytJGkOxNmNtQr-9166tjBQQR8Dl1KOJHcfd_d9hFxyKy1GdcVCqTjzgftMtRGlcDDKgCt06YIyP5LDYTCZhI_lHHdWdbtXJcnipa6H3Vz24Xp_BHMDpQwhz7rvVHYcRH96rksHXBaiXE52nvkYn6tS5nefWA1Gq5XQIsD0m__6tR2yXeaTtLc8ALtkzaZ7pFlpNdDy6u4T2UtpL_t8m-cztKQVFwmdAY2UxtiTUJUmdJxOy9UrGy2szQ7IuH87uhmwUjSBGR4EOet0Ad8NDm3tJdpTEvFZCNbveAgceAhCC2t8mRhhAk9oENKIBNM8EKGCLoDoHJJGOkvtEaGaQxhoYawUgDBTYG5pgYdKo51CmNYiXuW92JSM4k7YYhrXXMiFY2J0jOMgDeN2i1zVW-ZLOo3fjK8rd8flzcp-tj7-k_UF2RyMHqI4uhven5AtTIO6y7a-U9LIF-_2jGyYj_wlW5wXp-sL6e7FzA
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LSwMxEA6iIl6sT6zPHDwpodt00-wei1oUSynaSm9Lks2AWLeluwr-eyf7KBRUEI-BybIMSWY-Zub7CLngVlqM6oqFUnHmA_eZaiJK4WCUAVfo0jllfk_2-8F4HA5KndO06navSpLFTINjaUqyxiyGxmLwzWUirg9IMDdcyhD-rPkIZFxP1-PT86KMwGUu0OUk6JmPsboqa373ieXAtFwVzYNNt_bv39wmW2WeSTvFwdghKzbZJbVKw4GWV3qPyE5CO-nn2yyboiWtOEroFGhPaYxJMVVJTEfJpFy9suHc2nSfjLq3w-s7VoopMMODIGOtNuB7wqGpvVh7SiJuC8H6LQ8BBQ9BaGGNL2MjTOAJDUIaEWP6ByJU0AYQrQOymkwTe0io5hAGWhgrBSD8FJhzWuCh0minEL7ViVd5MjIl07gTvJhEC47k3DEROsZxk4ZRs04uF1tmBc3Gb8ZXleuj8salP1sf_cn6nGwMbrpR777_cEw2MTtqF91-J2Q1m7_bU7JuPrKXdH6WH7QvzALOsA
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+Asymptotic+Analysis+of+Labeled+and+Unlabeled+k-Trees&rft.jtitle=Algorithmica&rft.au=Drmota%2C+Michael&rft.au=Jin%2C+Emma+Yu&rft.date=2016-08-01&rft.pub=Springer+US&rft.issn=0178-4617&rft.eissn=1432-0541&rft.volume=75&rft.issue=4&rft.spage=579&rft.epage=605&rft_id=info:doi/10.1007%2Fs00453-015-0039-1&rft.externalDocID=10_1007_s00453_015_0039_1
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0178-4617&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0178-4617&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0178-4617&client=summon