— This paper examines stability properties of distance-based formations. These are formations encoded by inter-agent relative distances. A negative gradient control law is propos...
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
Kyriaki Ioannidou, George B. Mertzios, Stavros D. ...
Program dependence graphs are a well-established device to represent possible information flow in a program. Path conditions in dependence graphs have been proposed to express mo...
Recent approaches of graph comparison consider graphs as sets of paths [6, 5]. Kernels on graphs are then computed from kernels on paths. A common strategy for graph retrieval is ...
A graph G is hamiltonian-connected if any two of its vertices are connected by a Hamilton path (a path including every vertex of G); and G is s-hamiltonian-connected if the deleti...