Results 261 to 270 of about 954,754 (291)
Some of the next articles are maybe not open access.
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
European Journal of Operational Research, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Moshe Dror +2 more
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Moshe Dror +2 more
openaire +3 more sources
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 +3 more sources
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 +2 more sources
The Capacitated Minimum Spanning Tree
Networks, 1973AbstractThe capacitated minimum spanning tree is an offspring of the minimum spanning tree and network flow problems. It has application in the design of multipoint linkages in elementary teleprocessing tree networks. Some theorems are used in conjunction with Little's branch and bound algorithm to obtain optimal solutions.
K. Mani Chandy, Tachen Lo
openaire +2 more sources
Rooted Spanning Trees in Tournaments
Graphs and Combinatorics, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaoyun Lu +3 more
openaire +1 more source
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 +2 more sources
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 +2 more sources
Graphs and Combinatorics, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jun Fujisawa +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jun Fujisawa +2 more
openaire +1 more source