646 search results - page 86 / 130 » Generalized connected domination in graphs |
133
click to vote
SODA
2012
ACM
13 years 4 months ago
2012
ACM
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
100
click to vote
STACS
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
119
click to vote
FOCS
2000
IEEE
15 years 5 months ago
2000
IEEE
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
ICFP
2005
ACM
16 years 1 months ago
2005
ACM
Writing loops with tail-recursive function calls is the equivalent of writing them with goto's. Given that loop packages for Lisp-family languages have been around for over 2...
ISVC
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Linear systems and eigen-calculations on symmetric diagonally dominant matrices (SDDs) occur ubiquitously in computer vision, computer graphics, and machine learning. In ...