649 search results - page 3 / 130 » A Graph Pebbling Algorithm on Weighted Graphs |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Given an undirected graph G and an error parameter > 0, the graph sparsification problem requires sampling edges in G and giving the sampled edges appropriate weights to obtai...
AAAI
2012
11 years 10 months ago
2012
In cooperative games, a key question is to find a division of payoffs to coalition members in a fair manner. Nucleolus is one of such solution concepts that provides a stable sol...
WG
2004
Springer
14 years 27 days ago
2004
Springer
A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight independent set problem i...
DAM
2008
13 years 7 months ago
2008
Abstract. A graph is called equistable when there is a nonnegative weight function on its vertices such that a set S of vertices has total weight 1 if and only if S is maximal stab...
SIAMCOMP
2002
13 years 7 months ago
2002
Given an edge-weighted graph where all weights are nonnegative reals, an edge reweighting is an assignment of nonnegative reals to edges such that, for each vertex, the sums of giv...