Sciweavers

649 search results - page 43 / 130
» A Graph Pebbling Algorithm on Weighted Graphs
Sort
View
STACS
2010
Springer
16 years 12 days ago
Optimal Query Complexity for Reconstructing Hypergraphs
In this paper we consider the problem of reconstructing a hidden weighted hypergraph of constant rank using additive queries. We prove the following: Let G be a weighted hidden h...
Nader H. Bshouty, Hanna Mazzawi
ISAAC
1997
Springer
162views Algorithms» more  ISAAC 1997»
15 years 9 months ago
A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest
We present a randomized EREW PRAM algorithm to nd a minimum spanning forest in a weighted undirected graph. On an n-vertex graph the algorithm runs in o((logn)1+ ) expected time f...
Chung Keung Poon, Vijaya Ramachandran
COLING
2008
15 years 6 months ago
Detecting Multiple Facets of an Event using Graph-Based Unsupervised Methods
We propose a new unsupervised method for topic detection that automatically identifies the different facets of an event. We use pointwise Kullback-Leibler divergence along with th...
Pradeep Muthukrishnan, Joshua Gerrish, Dragomir R....
ICALP
2001
Springer
15 years 10 months ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan
AAAI
2010
15 years 6 months ago
Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments
We present a fast local search algorithm that finds an improved solution (if there is any) in the k-exchange neighborhood of the given solution to an instance of WEIGHTED FEEDBACK...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...