Filters
Neighborhood unions and extremal spanning trees
to a condition for the existence of a spanning tree with a bounded number of leaves. Both of the conditions involve neighborhood unions. Further, we present two results on spanning spiders (trees with a single bra...
BA - Obecná matematika
- 2008 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
The minimum spanning tree problem
This part of the book deals with graph theory, namely with the known minimum spanning tree problem. The clasical solutions of the problem are introduced and disscused there....
AM - Pedagogika a školství
- 2008 •
- C
Rok uplatnění
C - Kapitola v odborné knize
Graph Algorithms - the minimum spanning tree
The article introduces formulation and solutions of the minimum spanning tree problem and its using. It is written by way suitable for students from high schools....
BB - Aplikovaná statistika, operační výzkum
- 2001 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Factorizations of complete graphs into spanning trees with all possible maximum degrees
Fronček and Kovářová provided spanning trees of order 2n that factorize K_{2n} for every n>=2 and for every feasible diameter d, 3<=d<=2n-1. We extend they work and give a spanning tree on 2n vertices with a maximu...
BA - Obecná matematika
- 2009 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Communication Faults in Robot Formation Control: a Reconfigurable Spanning Tree Approach
This poster paper proposes to use a spanning tree communication network to control the formation of a large group of robots. The spanning tree structure minimizes the communication traffic. However, should a loss o...
Robotics and automatic control
- 2017 •
- D
Rok uplatnění
D - Stať ve sborníku
Application of Minimum Spanning Tree Problem in Crisis Planning
The text deals with certain possibilities of utilization of methods intended for determination of minimum spanning tree in the sphere of crisis management....
JO - Pozemní dopravní systémy a zařízení
- 2005 •
- D
Rok uplatnění
D - Stať ve sborníku
Factorizations of Complete Graphs into Spanning trees
We examine decompositions of complete graphs K2n into n isomorphic spanning trees. For n even, we develop a method of factorization based on a new type of vertex labeling, namely switching blended labeling. We also present a recursi...
BA - Obecná matematika
- 2003 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Infinite paths in locally finite graphs and in their spanning trees.
The paper concerns infinite paths (in particular, the maximum number of pairwise vertex-disjoint ones) in locally finite graphs and in spanning trees of such graphs....
BA - Obecná matematika
- 2003 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
The Origins of Minimal Spanning Tree Algorithms -- Borůvka and Jarník
We trace the early history of Minimum spanning tree algorithm in the work of Boruvka and Jarnik from the point of view of historical and scientific context....
BA - Obecná matematika
- 2012 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Infinite paths in locally finite draphs and in their spanning trees
Infinite paths in locally finite draphs and in their spanning trees...
BA - Obecná matematika
- 2002 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
- 1 - 10 out of 20 293