Results 271 to 280 of about 49,235 (305)
Some of the next articles are maybe not open access.
Information Processing Letters, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Samir Khuller, Baruch Schieber
exaly +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Samir Khuller, Baruch Schieber
exaly +2 more sources
Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees
Discrete Applied Mathematics, 2018 International audienceThe search of spanning trees with interesting disjunction properties has led to the introduction of edge-disjoint spanning trees, independent spanning trees and more recently completely independent spanning trees.
Olivier Togni
exaly +2 more sources
European Journal of Operational Research, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Moshe Dror +2 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Moshe Dror +2 more
openaire +2 more sources
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
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
On Torsor Structures on Spanning Trees
SIAM Journal on Discrete Mathematics, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Farbod Shokrieh, Cameron Wright
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
From Spanning Trees to Meshed Trees
2020 International Conference on COMmunication Systems & NETworkS (COMSNETS), 2020Switching operations, at Layer 2 of the network protocol stack, are fundamental to network communications. The internal networks of data centers, as well as traditional Layer 2 networks - customer, service provider, and backbone provider networks [1], [2] - rely primarily on switching operations.
Hrishikesh B. Acharya +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
Spanning Trees with Few Leaves
Graphs and Combinatorics, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Masao Tsugaki, Tomoki Yamashita
openaire +1 more source