Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.
H. Edelsbrunner, E. Welzl, P.K. Agarwal, O. Schwarzkopf (1991)
Discrete & computational geometry
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Transitions in Geometric Minimum Spanning Trees.”
Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.
Direction Trees.
R.E. Jamison (1987)
Discrete & computational geometry
Similarity:
Low-Degree Minimum Spanning Trees.
G. Robins, J.S. Salowe (1995)
Discrete & computational geometry
Similarity:
Worst-Case Minimum Rectilinear Steiner Trees in All Dimensions.
M. Yvinec (1992)
Discrete & computational geometry
Similarity:
On Minimum and Maximum Spanning Trees of Linearly Moving Points.
T. Tokuyama, N. Katoh, K. Iwano (1995)
Discrete & computational geometry
Similarity:
Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions.
D. Eppstein (1995)
Discrete & computational geometry
Similarity:
Deducing Properties of Trees From Their Matula Numbers
Ivan Gutman, Yeong-Nan Yeh (1993)
Publications de l'Institut Mathématique
Similarity:
Completely Independent Spanning Trees in (Partial) k-Trees
Masayoshi Matsushita, Yota Otachi, Toru Araki (2015)
Discussiones Mathematicae Graph Theory
Similarity:
Two spanning trees T1 and T2 of a graph G are completely independent if, for any two vertices u and v, the paths from u to v in T1 and T2 are internally disjoint. For a graph G, we denote the maximum number of pairwise completely independent spanning trees by cist(G). In this paper, we consider cist(G) when G is a partial k-tree. First we show that [k/2] ≤ cist(G) ≤ k − 1 for any k-tree G. Then we show that for any p ∈ {[k/2], . . . , k − 1}, there exist infinitely many k-trees G such...
On the normal disconnection of a tree
A. Kośliński (1987)
Applicationes Mathematicae
Similarity:
On A-Trees
Đuro Kurepa (1968)
Publications de l'Institut Mathématique
Similarity:
-trees and normalization of pseudogroups.
Rimlinger, Frank (1992)
Experimental Mathematics
Similarity:
An axiomatic theory of information trees
Keh-Hsun Chen, Zbigniew W. Ras (1988)
Banach Center Publications
Similarity: