255 search results - page 4 / 51 » Approximate Tree Embedding Problem - An Algebraic Approach |
114
click to vote
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract— We present a systematic method for model reduction of a class of input-quantized systems in the max-plus algebra. We consider a generalization of the flow shop with ï¬...
137
Voted
SIAMJO
2008
15 years 1 months ago
2008
Eigenvectors to the second smallest eigenvalue of the Laplace matrix of a graph, also known as Fiedler vectors, are the basic ingredient in spectral graph partitioning heuristics....
106
Voted
SODA
2010
ACM
15 years 11 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
100
Voted
VLDB
2005
ACM
15 years 7 months ago
2005
ACM
XML and XQuery semantics are very sensitive to the order of the produced output. Although pattern-tree based algebraic approaches are becoming more and more popular for evaluating...