554 search results - page 29 / 111 » Optimizing in Graphs with Expensive Computation of Edge Weig... |
158
Voted
STOC
2009
ACM
16 years 6 months ago
2009
ACM
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...
153
click to vote
SBACPAD
2003
IEEE
15 years 11 months ago
2003
IEEE
— Scheduling by Edge Reversal (SER) is a fully distributed scheduling mechanism based on the manipulation of acyclic orientations of a graph. This work uses SER to perform constr...
156
click to vote
ACL
2010
15 years 3 months ago
2010
We propose a global algorithm for learning entailment relations between predicates. We define a graph structure over predicates that represents entailment relations as directed ed...
182
click to vote
WADS
2009
Springer
16 years 10 days ago
2009
Springer
We consider the pair (pi, fi) as a force with two-dimensional direction vector fi applied at the point pi in the plane. For a given set of forces we ask for a non-crossing geometri...
172
click to vote
KDD
2005
ACM
16 years 6 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...