Subgraph statistics in subcritical graph classes

Autor: Drmota, Michael, Ramos, Lander, Rué, Juanjo

Let $H$ be a fixed graph and $\mathcal{G}$ a subcritical graph class. In this paper we show that the number of occurrences of $H$ (as a subgraph) in a uniformly at random graph of size $n$ in $\mathcal{G}$ follows a normal limiting distribution with

Externí odkaz: http://arxiv.org/abs/1512.08889

Random planar maps and graphs with minimum degree two and three

Autor: Noy, Marc, Ramos, Lander

We find precise asymptotic estimates for the number of planar maps and graphs with a condition on the minimum degree, and properties of random graphs from these classes. In particular we show that the size of the largest tree attached to the core of

Externí odkaz: http://arxiv.org/abs/1403.5211

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

First-Order Unification on Compressed Terms

Autor: Gascón, Adrià, Maneth, Sebastian, Ramos, Lander

Publikováno v: Gascon Caro, A, Maneth, S & Ramos, L 2011, First-Order Unification on Compressed Terms . in Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, RTA 2011, May 30-June 1, 2011, Novi Sad, Serbia . pp. 51-60 . https://doi.org/10.4230/LIPIcs.RTA.2011.51

Singleton Tree Grammars (STGs) have recently drawn considerable attention. They generalize the sharing of subtrees known from DAGs to sharing of connected subgraphs. This allows to obtain smaller in-memory representations of trees than with DAGs. In

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b61d9ab594274a6418108fe47668312c
https://www.pure.ed.ac.uk/ws/files/17895203/Gascon_Maneth_ET_AL_2011_First_Order_Unification_on_Compressed_Terms.pdf