Results 261 to 270 of about 48,244 (304)
Some of the next articles are maybe not open access.
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
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
Counting Weighted Spanning Trees to Solve Constrained Minimum Spanning Tree Problems
2017Building on previous work about counting the number of spanning trees of an unweighted graph, we consider the case of edge-weighted graphs. We present a generalization of the former result to compute in pseudo-polynomial time the exact number of spanning trees of any given weight, and in particular the number of minimum spanning trees.
Antoine Delaite, Gilles Pesant
openaire +2 more sources
Journal of Algorithms, 1983
Abstract Dans cet article, nous proposons un algorithme de complexite polynomiale pour construire un arbre au hasard qui soit un graphe partiel d'un graphe donne. Il consiste essentielleement a construire une arborescence de rang donne sur ce graphe, l'ensemble des arborescences etant ordonne par rapport aux valeurs croissantes de la racine et a ...
openaire +1 more source
Abstract Dans cet article, nous proposons un algorithme de complexite polynomiale pour construire un arbre au hasard qui soit un graphe partiel d'un graphe donne. Il consiste essentielleement a construire une arborescence de rang donne sur ce graphe, l'ensemble des arborescences etant ordonne par rapport aux valeurs croissantes de la racine et a ...
openaire +1 more source
Journal of Optimization Theory and Applications, 1985
The definition of a shortest spanning tree of a graph is generalized to that of an efficient spanning tree for graphs with vector weights, where the notion of optimality is of the Pareto type. An algorithm for obtaining all efficient spanning trees is presented.
openaire +1 more source
The definition of a shortest spanning tree of a graph is generalized to that of an efficient spanning tree for graphs with vector weights, where the notion of optimality is of the Pareto type. An algorithm for obtaining all efficient spanning trees is presented.
openaire +1 more source
Integrative oncology: Addressing the global challenges of cancer prevention and treatment
Ca-A Cancer Journal for Clinicians, 2022Jun J Mao,, Msce +2 more
exaly