Results 241 to 250 of about 80,587 (266)
Some of the next articles are maybe not open access.
1995
A k-tree is defined recursively to be either a K-clique or a graph T that contains a vertex v whose neighbourhood in T induces a k-clique and whose removal results in a k-tree. The existence of a spanning k-tree in a communication network is closely related to the reliability of the network, and it is known that the problem of determining whether a ...
openaire +1 more source
A k-tree is defined recursively to be either a K-clique or a graph T that contains a vertex v whose neighbourhood in T induces a k-clique and whose removal results in a k-tree. The existence of a spanning k-tree in a communication network is closely related to the reliability of the network, and it is known that the problem of determining whether a ...
openaire +1 more source
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
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
Finding Minimum Spanning Trees
SIAM Journal on Computing, 1976This paper studies methods for finding minimum spanning trees in graphs. Results include 1. several algorithms with $O(m\log \log n)$ worst-case running times, where n is the number vertices and m is the number of edges in the problem graph; 2. an $O(m)$ worst-case algorithm for dense graphs (those for which m is $\Omega (n^{1 + \varepsilon } )$ for ...
David R. Cheriton, Robert Endre Tarjan
openaire +2 more sources
Optimum Communication Spanning Trees
SIAM Journal on Computing, 1974Given a set of nodes $N_i (i = 1,2, \cdots ,n)$ which may represent cities and a set of requirements $r_{ij} $ which may represent the number of telephone calls between $N_i $ and $N_j $, the problem is to build a spanning tree connecting these n nodes such that the total cost of communication of the spanning tree is a minimum among all spanning trees.
openaire +2 more sources
A Benders decomposition approach for the robust spanning tree problem with interval data
European Journal of Operational Research, 2006Roberto Montemanni
exaly
A swarm intelligence approach to the quadratic minimum spanning tree problem
Information Sciences, 2010, Alok Singh
exaly
An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem
Applied Soft Computing Journal, 2009Alok Singh
exaly
An optimal minimum spanning tree algorithm
Journal of the ACM, 2002Seth Pettie, Vijaya Ramachandran
exaly