Sciweavers

GD
2009
Springer
13 years 9 months ago
Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs
Abstract. The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings...
Ioannis Z. Emiris, Elias P. Tsigaridas, Antonios V...
CORR
2010
Springer
99views Education» more  CORR 2010»
13 years 11 months ago
On Equivalence Between Network Topologies
One major open problem in network coding is to characterize the capacity region of a general multi-source multi-demand network. There are some existing computational tools for boun...
Michelle Effros, Tracey Ho, Shirin Jalali
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
14 years 25 days ago
The rectilinear Steiner arborescence problem is NP-complete
Given a set P of points in the first quadrant, a Rectilinear Steiner Arborescence (RSA) is a directed tree rooted at the origin, containing all points in P, and composed solely of...
Weiping Shi, Chen Su