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...

Celý popis

Podrobná bibliografie

Vydáno v:	Algorithmica Ročník 75; číslo 4; s. 579 - 605
Hlavní autoři:	Drmota, Michael, Jin, Emma Yu
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.08.2016
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!