649 search results - page 29 / 130 » A Graph Pebbling Algorithm on Weighted Graphs |
AI
2010
Springer
13 years 9 months ago
2010
Springer
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...
WG
2005
Springer
14 years 2 months ago
2005
Springer
In unweighted case, approximation ratio for the independent set problem has been analyzed in terms of the graph parameters, such as the number of vertices, maximum degree, and aver...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
—We consider point to point link scheduling in Spatial Time Division Multiple Access (STDMA) wireless networks under the physical interference model. We propose a novel link sche...
ECML
2006
Springer
14 years 15 days ago
2006
Springer
In many graph-based semi-supervised learning algorithms, edge weights are assumed to be fixed and determined by the data points' (often symmetric) relationships in input space...