Sciweavers

Share
3 search results - page 1 / 1
» Generating Random Spanning Trees via Fast Matrix Multiplicat...
Sort
View
LATIN
2016
Springer
3 years 12 days ago
Generating Random Spanning Trees via Fast Matrix Multiplication
We consider the problem of sampling a uniformly random spanning tree of a graph. This is a classic algorithmic problem for which several exact and approximate algorithms are known....
Nicholas J. A. Harvey, Keyulu Xu
TCAD
2002
128views more  TCAD 2002»
8 years 3 months ago
Preferred direction Steiner trees
Interconnect optimization for VLSI circuits has received wide attention. To model routing surfaces, multiple circuit layers are freabstracted as a single rectilinear plane, ignori...
Mehmet Can Yildiz, Patrick H. Madden
CP
2003
Springer
8 years 9 months ago
A SAT-Based Approach to Multiple Sequence Alignment
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
Steven David Prestwich, Desmond G. Higgins, Orla O...
books