2 papers
cs.DS2019
Algorithms for flows over time with scheduling costs
Dario Frascaria, Neil Olver
Flows over time have received substantial attention from both an optimization and (more recently) a game-theoretic perspective. In this model, each arc has an associated delay for…
cs.DM2012
All graphs with at most seven vertices are Pairwise Compatibility Graphs
Tiziana Calamoneri, Dario Frascaria, Blerina Sinaimeri
A graph is called a pairwise compatibility graph (PCG) if there exists an edge-weighted tree and two non-negative real numbers and such that each leaf $…