1327 search results - page 91 / 266 » Path following algorithm for the graph matching problem |
116
click to vote
CIDM
2009
IEEE
15 years 5 months ago
2009
IEEE
The graph classification problem is learning to classify separate, individual graphs in a graph database into two or more categories. A number of algorithms have been introduced fo...
142
click to vote
WADS
2007
Springer
15 years 8 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
113
Voted
APPROX
2010
Springer
15 years 3 months ago
2010
Springer
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...
117
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
We present a general framework to model strategic aspects and stable and fair resource allocations in networks via variants and generalizations of path coalitional games. In these ...
135
Voted
ICRA
2007
IEEE
15 years 8 months ago
2007
IEEE
— In this paper, a path planning and its evaluation method is described with taking into account wheel slip dynamics of lunar/planetary exploration rovers. The surface of the pla...