We consider computational complexity questions related to parallel knock-out schemes for graphs. In such schemes, in each round, each remaining vertex of a given graph eliminates ...
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...
Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delli...
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
An intense activity is nowadays devoted to the definition of models capturing the properties of complex networks. Among the most promising approaches, it has been proposed to model...
Matthieu Latapy, Thi Ha Duong Phan, Christophe Cre...
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...