6740 search results - page 393 / 1348 » An s -Hamiltonian Line Graph Problem |
158
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
122
click to vote
FUIN
2006
15 years 4 months ago
2006
We examine the power and limitations of the weakest vertex relabelling system which allows to change a label of a vertex in function of its own label and of the label of one of its...
157
click to vote
IPL
2002
15 years 4 months ago
2002
The area of approximation algorithms for the Steiner tree problem in graphs has seen continuous progress over the last years. Currently the best approximation
204
click to vote
NETWORKS
2011
14 years 11 months ago
2011
We present an exact algorithm for computing an earliest arrival flow in a discrete time setting on series-parallel graphs. In contrast to previous results for the earliest arrival...
134
click to vote
KDD
2009
ACM
16 years 5 months ago
2009
ACM
Counting the number of triangles in a graph is a beautiful algorithmic problem which has gained importance over the last years due to its significant role in complex network analy...