Sciweavers

5100 search results - page 73 / 1020
» The Linear Complexity of a Graph
Sort
View
RSA
2000
104views more  RSA 2000»
13 years 7 months ago
Construction of expanders and superconcentrators using Kolmogorov complexity
We show the existence of various versions of expander graphs using Kolmogorov complexity. This method seems superior to the usual probabilistic construction. It turns out that the...
Uwe Schöning
ISAAC
1997
Springer
162views Algorithms» more  ISAAC 1997»
14 years 2 days 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
DAC
2000
ACM
14 years 9 months ago
Analysis of composition complexity and how to obtain smaller canonical graphs
Jawahar Jain, K. Mohanram, Dinos Moundanos, Ingo W...
PAKDD
2010
ACM
179views Data Mining» more  PAKDD 2010»
14 years 21 days ago
Answer Diversification for Complex Question Answering on the Web
We present a novel graph ranking model to extract a diverse set of answers for complex questions via random walks over a negative-edge graph. We assign a negative sign to edge weig...
Palakorn Achananuparp, Xiaohua Hu, Tingting He, Ch...
FSTTCS
2010
Springer
13 years 6 months ago
The effect of girth on the kernelization complexity of Connected Dominating Set
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
Neeldhara Misra, Geevarghese Philip, Venkatesh Ram...