1090 search results - page 32 / 218 » Priority Algorithms for Graph Optimization Problems |
105
Voted
ICCV
2007
IEEE
16 years 4 months ago
2007
IEEE
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible...
126
click to vote
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
121
Voted
WEA
2007
Springer
15 years 8 months ago
2007
Springer
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
148
Voted
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
116
Voted
RANDOM
1999
Springer
15 years 6 months ago
1999
Springer
We present a randomized algorithm to nd a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an...