Zobrazeno 1 - 10
of 156
pro vyhledávání: '"Petreschi, Rossella"'
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
In topology recognition, each node of an anonymous network has to deterministically produce an isomorphic copy of the underlying graph, with all ports correctly marked. This task is usually unfeasible without any a priori information. Such informatio
Externí odkaz:
http://arxiv.org/abs/1601.06040
Publikováno v:
In Theoretical Computer Science 29 October 2019 791:62-75
A graph $G$ is called a pairwise compatibility graph (PCG) if there exists an edge weighted tree $T$ and two non-negative real numbers $d_{min}$ and $d_{max}$ such that each leaf $l_u$ of $T$ corresponds to a vertex $u \in V$ and there is an edge $(u
Externí odkaz:
http://arxiv.org/abs/1105.2171
Publikováno v:
In Theoretical Computer Science 29 March 2018 718:46-57
Publikováno v:
In Information and Computation April 2016 247:254-265
Publikováno v:
In Theoretical Computer Science 28 August 2014 547:82-89
Publikováno v:
In Discrete Applied Mathematics 2011 159(12):1196-1206
Publikováno v:
In Theoretical Computer Science 2007 382(2):97-108
Publikováno v:
In Discrete Applied Mathematics 2006 154(17):2445-2457