Results 271 to 280 of about 954,754 (291)
Some of the next articles are maybe not open access.
Counting Spanning Trees to Guide Search in Constrained Spanning Tree Problems
2013Counting-based branching heuristics such as maxSD were shown to be effective on a variety of constraint satisfaction problems. These heuristics require that we equip each family of constraints with a dedicated algorithm to compute the local solution density of variable assignments, much as what has been done with filtering algorithms to apply local ...
Simon Brockbank +2 more
openaire +1 more source
On generalized minimum spanning trees
European Journal of Operational Research, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Corinne Feremans +2 more
openaire +5 more sources
Tunable survivable spanning trees
ACM SIGMETRICS Performance Evaluation Review, 2014Coping with network failures has become a major networking challenge. The concept of tunable survivability provides a quantitative measure for specifying any desired level (0%-100%) of survivability, thus offering flexibility in the routing choice. Previous works focused on implementing this concept on unicast transmissions. However, vital
Jose Yallouz +2 more
openaire +1 more source
Independent Spanning Trees in Networks: A Survey
ACM Computing Surveys, 2023Baolei Cheng, Jianxi Fan, Dajin Wang
exaly
Dirac's Condition for Completely Independent Spanning Trees
Journal of Graph Theory, 2014Toru Araki
exaly
Spanning Trees on the Sierpinski Gasket
Journal of Statistical Physics, 2007Lung-Chi Chen +2 more
exaly
Completely independent spanning trees in the underlying graph of a line digraph
Discrete Mathematics, 2001Toru Hasunuma
exaly
Constructing edge-disjoint spanning trees in twisted cubes
Information Sciences, 2010Ming-Chien Yang
exaly
New method for counting the number of spanning trees in a two-tree network
Physica A: Statistical Mechanics and Its Applications, 2013Haixing Zhao, Yuzhi Xiao
exaly