1447 search results - page 15 / 290 » Graphs and Path Equilibria |
CDC
2008
IEEE
15 years 6 months ago
2008
IEEE
— 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...
MFCS
2009
Springer
15 years 6 months ago
2009
Springer
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 ...
SCAM
2007
IEEE
15 years 6 months ago
2007
IEEE
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...
ICPR
2010
IEEE
15 years 3 months ago
2010
IEEE
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 ...
DM
2008
14 years 11 months ago
2008
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...