Sciweavers

1447 search results - page 15 / 290
» Graphs and Path Equilibria
Sort
View
CDC
2008
IEEE
105views Control Systems» more  CDC 2008»
14 years 4 months ago
On the stability of distance-based formation control
— 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...
Dimos V. Dimarogonas, Karl Henrik Johansson
MFCS
2009
Springer
14 years 4 months ago
The Longest Path Problem Is Polynomial on Interval Graphs
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. ...
SCAM
2007
IEEE
14 years 3 months ago
On Temporal Path Conditions in Dependence Graphs
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...
Andreas Lochbihler, Gregor Snelting
ICPR
2010
IEEE
14 years 29 days ago
Kernel on Graphs Based on Dictionary of Paths for Image Retrieval
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 ...
Jean-Emmanuel Haugeard, Sylvie Philipp-Foliguet, P...
DM
2008
76views more  DM 2008»
13 years 9 months ago
On s-hamiltonian-connected line graphs
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...
Hong-Jian Lai, Yanting Liang, Yehong Shao