18 citations · 18 across the 1 of their papers we have counts for
2 papers
cs.DM2017
Some classes of graphs that are not PCGs
Pierluigi Baiocchi, Tiziana Calamoneri, Angelo Monti +1
A graph is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree and two non-negative real numbers and , $d_{min} \leq d_{max}…
astro-ph.IM2012★ 18 cited
Complexity reduction of astrochemical networks
T. Grassi, S. Bovino, F. A. Gianturco +2
We present a new computational scheme aimed at reducing the complexity of the chemical networks in astrophysical models, one which is shown to markedly improve their computational…