1447 search results - page 148 / 290 » Graphs and Path Equilibria |
115
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Let C be a compact and convex set in the plane that contains the origin in its interior, and let S be a finite set of points in the plane. The Delaunay graph DGC (S) of S is define...
124
click to vote
DAM
2008
15 years 4 months ago
2008
Given an edge- or vertex-weighted graph or digraph and a list of source-sink pairs, the minimum multicut problem consists in selecting a minimum weight set of edges or vertices wh...
132
click to vote
WG
2010
Springer
15 years 2 months ago
2010
Springer
We consider the problem of finding a k-edge transversal set that covers all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, refe...
115
click to vote
ICML
2003
IEEE
16 years 5 months ago
2003
IEEE
A new kernel function between two labeled graphs is presented. Feature vectors are defined as the counts of label paths produced by random walks on graphs. The kernel computation ...
155
click to vote
ISCC
1999
IEEE
15 years 8 months ago
1999
IEEE
Due to the wide range of services being supported, telecommunications networks are loaded with massive quantities of information. This stimulates extra concern for network surviva...