554 search results - page 11 / 111 » Optimizing in Graphs with Expensive Computation of Edge Weig... |
157
click to vote
APPROX
2008
Springer
15 years 7 months ago
2008
Springer
Given a graph H = (V, F) with edge weights {w(e) : e F}, the weighted degree of a node v in H is {w(vu) : vu F}. We give bicriteria approximation algorithms for problems that see...
169
click to vote
STACS
2007
Springer
15 years 11 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
127
click to vote
CORR
2007
Springer
15 years 5 months ago
2007
Springer
We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching poly...
169
click to vote
ALGORITHMICA
2011
15 years 22 days ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
156
click to vote
NIPS
2003
15 years 7 months ago
2003
This paper presents a novel graph-theoretic approach, named ratio contour, to extract perceptually salient boundaries from a set of noisy boundary fragments detected in real image...