Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Pierluigi Baiocchi"'
Publikováno v:
Theoretical Computer Science. 791:62-75
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::377a8542499737048e15eecb961e31a2
https://doi.org/10.1016/j.tcs.2019.05.017
https://doi.org/10.1016/j.tcs.2019.05.017
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319946665
IWOCA
IWOCA
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} \le d_{max}\), such that each node \(u \in V\) is uniquely associated to a le
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::825ca9cc7d7a8bf260b589507b33ef55
https://doi.org/10.1007/978-3-319-94667-2_4
https://doi.org/10.1007/978-3-319-94667-2_4
