Results 261 to 270 of about 81,428 (311)
Some of the next articles are maybe not open access.
International Journal of Foundations of Computer Science, 2013
Combinatorial Optimization is combined with Social Choice Theory when the goal is to decide on the quality of a spanning tree of an undirected graph. Given individual preferences over the edges of the graph, spanning trees are compared by means of a Condorcet criterion.
openaire +1 more source
Combinatorial Optimization is combined with Social Choice Theory when the goal is to decide on the quality of a spanning tree of an undirected graph. Given individual preferences over the edges of the graph, spanning trees are compared by means of a Condorcet criterion.
openaire +1 more source
Mathematics of Operations Research, 1995
We given an algorithm for packing spanning trees in a graph G = (V, E), with capacities on the edges. The problem reduces to O(|V|2) maximum flow computations. The algorithm is based on Nash-Williams's proof of a min-max relation for this problem.
openaire +1 more source
We given an algorithm for packing spanning trees in a graph G = (V, E), with capacities on the edges. The problem reduces to O(|V|2) maximum flow computations. The algorithm is based on Nash-Williams's proof of a min-max relation for this problem.
openaire +1 more source
Graphs and Combinatorics, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fujisawa, Jun +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fujisawa, Jun +2 more
openaire +1 more source
Graphs and Combinatorics, 2010
This survey does not contain any proofs, only definitions, statements of known results and related open problems, and 195 references. Considered types of spanning trees: with upper bounds on degrees, with upper bounds on the number of leaves or on the number of branch vertices, with small average distance, preserving degrees of as many vertices as ...
Ozeki, Kenta, Yamashita, Tomoki
openaire +2 more sources
This survey does not contain any proofs, only definitions, statements of known results and related open problems, and 195 references. Considered types of spanning trees: with upper bounds on degrees, with upper bounds on the number of leaves or on the number of branch vertices, with small average distance, preserving degrees of as many vertices as ...
Ozeki, Kenta, Yamashita, Tomoki
openaire +2 more sources
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 ...
Cheriton, David, Tarjan, Robert Endre
openaire +2 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
SIAM Journal on Algebraic Discrete Methods, 1986
The author continues the investigation of \textit{H. Shank} in the papers ''Graph property recognition machines'' published in Math. Systems Theory 5 (1971), and ''The theory of left-right paths'' [Comb. Math. III, Proc. 3rd Australian Conf., St. Lucia 1974, Lect. Notes Math. 452, 42-54 (1975; Zbl 0307.05120)].
openaire +1 more source
The author continues the investigation of \textit{H. Shank} in the papers ''Graph property recognition machines'' published in Math. Systems Theory 5 (1971), and ''The theory of left-right paths'' [Comb. Math. III, Proc. 3rd Australian Conf., St. Lucia 1974, Lect. Notes Math. 452, 42-54 (1975; Zbl 0307.05120)].
openaire +1 more source
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