Sciweavers

754 search results - page 118 / 151
» Exact Algorithms for the Vertex Separator Problem in Graphs
Sort
View
ALGORITHMICA
2008
82views more  ALGORITHMICA 2008»
13 years 8 months ago
Random Bichromatic Matchings
Given a graph with edges colored Red and Blue, we wish to sample and approximately count the number of perfect matchings with exactly k Red edges. We study a Markov chain on the sp...
Nayantara Bhatnagar, Dana Randall, Vijay V. Vazira...
WABI
2007
Springer
14 years 2 months ago
Topology Independent Protein Structural Alignment
Abstract. Protein structural alignment is an indispensable tool used for many different studies in bioinformatics. Most structural alignment algorithms assume that the structural ...
Joe Dundas, T. Andrew Binkowski, Bhaskar DasGupta,...
ADHOCNOW
2004
Springer
14 years 1 months ago
Approximating the Minimum Number of Maximum Power Users in Ad Hoc Networks
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
Errol L. Lloyd, Rui Liu, S. S. Ravi
CIKM
2009
Springer
13 years 11 months ago
Semantic queries in databases: problems and challenges
Supporting semantic queries in relational databases is essential to many advanced applications. Recently, with the increasing use of ontology in various applications, the need for...
Lipyeow Lim, Haixun Wang, Min Wang
DISOPT
2008
107views more  DISOPT 2008»
13 years 8 months ago
The k-path tree matroid and its applications to survivable network design
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
Esther M. Arkin, Refael Hassin