Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Baiocchi, Pierluigi"'
A graph $G=(V,E)$ is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree $T$ and two non-negative real numbers $d_{min}$ and $d_{max}$, $d_{min} \leq d_{max}$, such that each node $u \in V$ is uniquely associated to a leaf of $
Externí odkaz:
http://arxiv.org/abs/1707.07436
Publikováno v:
In Theoretical Computer Science 29 October 2019 791:62-75
This book constitutes the refereed post-conference proceedings of the 29th International Workshop on Combinatorial Algorithms, IWOCA 2018, held in Singapore, Singapore, in July 2018. The 31 regular papers presented in this volume were carefully revie