Graph limits of random graphs from a subset of connected k-trees. | Random Struct Algorithms;55(1): 125-152, 2019 Aug. | MEDLINE

Main content 1 Search 2 Footer 3

+A A -A High contrast

VHL Regional Portal

Information and Knowledge for Health

Subject descriptor lookup Advanced Search EVID@Easy

Graph limits of random graphs from a subset of connected k-trees.

Drmota, Michael; Jin, Emma Yu; Stufler, Benedikt.

Affiliation

Drmota M; Institut für Diskrete Mathematik und Geometrie Technische Universität Wien Vienna Austria.
Jin EY; Institut für Diskrete Mathematik und Geometrie Technische Universität Wien Vienna Austria.
Stufler B; Unité de Mathématiques Pures et Appliquées École Normale Suprieure de Lyon Lyon Cedex 07 France.

Random Struct Algorithms ; 55(1): 125-152, 2019 Aug.

Article in En | MEDLINE | ID: mdl-31423073

Key words

continuum random tree; modified GaltonWatson tree; partial ktrees

Search on Google

Full text: 1 Collection: 01-internacional Database: MEDLINE Type of study: Clinical_trials Language: En Journal: Random Struct Algorithms Year: 2019 Document type: Article Country of publication: United States

Search on Google

Full text: 1 Collection: 01-internacional Database: MEDLINE Type of study: Clinical_trials Language: En Journal: Random Struct Algorithms Year: 2019 Document type: Article Country of publication: United States