Results 11 to 20 of about 207,808 (198)
Median Sets and Median Number of a Graph [PDF]
ISRN Discrete Mathematics, 2012 A profile is a finite sequence of vertices of a graph. The set of all vertices of the graph which minimises the sum of the distances to the vertices of the profile is the median of the profile. Any subset of the vertex set such that it is the median of some profile is called a median set. The number of median sets of a graph is defined to be the median
Kannan, Balakrishnan, Ram Kumar, r
openaire +2 more sources
The Median Stabilization Degree of a Median Algebra [PDF]
Journal of Algebraic Combinatorics, 1999 A median algebra consists of a set \(M\) and a median operator on \(M\), which is a symmetric function \(m: M^3\to M\) such that \(m(a,a,b)= a\) and \(m(m(a,b,c),d,c)= m(a, m(b,c,d), c)\). The median stabilization degree (msd, for short) of a median algebra measures the largest possible number of steps needed to generate a subalgebra with an arbitrary ...
Bandelt, H.-J., van de Vel, M.L.J.
openaire +2 more sources
Discrete Applied Mathematics, 1984 If G is an undirected graph, V(G) is its vertex set and \(A\subseteq V(G)\), then a median of A is any vertex of G which has the minimal sum of distance from all vertices of A. If each subset of V(G) having three vertices has exactly one median, then G is called a median graph. The properties of median graphs are studied.
Hans-Jürgen Bandelt +1 more
openaire +1 more source
The median procedure on median graphs
Discrete Applied Mathematics, 1998 An ordered \(k\)-tuple \(\pi= (x_1,\dots, x_k)\) of elements of a finite metric space \((X, d)\) is called a profile. An element \(x\in X\) for which \(\sum^k_{i= 1}d(x, x_i)\) is minimum is called a median of \(\pi\). The median procedure is the function \(\text{Med}(\pi)= \{x\mid x\) is a median of \(\pi\}\).
Fred R. McMorris +2 more
openaire +2 more sources
J. Comput. Geom., 2018 Several minor edits; Step 2 in Proof of Theorem 4.1.3 ...
Yunfeng Hu +4 more
openaire +2 more sources
Alʹmanah Kliničeskoj Mediciny, 2016 Vascular calcification or ectopic mineralization in blood vessels is an active, cell-regulated process, increasingly recognized as a general cardiovascular risk factor.
A. Dolzhenko, T. Richter, S. Sagalovsky
doaj +1 more source
On median graphs and median grid graphs
Discrete Mathematics, 2000 Let \(G= (V,E)\) be a graph with \(|V|= n\) and \(|E|= m\). A cycle \(Q_4\) of length four is called a square and the distance \(d(u,v)\) between vertices \(u\) and \(v\) of \(G\) is the usual shortest path distance. A vertex \(x\) is a median of a triple of vertices \(u\), \(v\) and \(w\) if \(d(u,x)+ d(x,v)= d(u,v)\), \(d(v,x)+ d(x,w)= d(v,w)\) and \(
Sandi Klavzar, Riste Skrekovski
openaire +1 more source
Median and Hybrid Median K-Dimensional Trees
, 2022 We consider here two new variants of K-dimensional binary search trees (K-d trees): median K-d trees and hybrid-median K-d trees. These two kinds of trees are designed with the aim to get a tree as balanced as possible. This goal is attained by heuristics that choose for each node of the K-d tree the appropriate coordinate to discriminate.
Duch Brown, Amalia +3 more
openaire +2 more sources
The median function on median graphs and semilattices
Discrete Applied Mathematics, 2000 Let \(\pi = (x_1, x_2, \dots, x_k)\) be a \(k\)-tuple of vertices in a finite connected graph \(G\). A median of \(\pi\) is a vertex \(x\) for which \(\sum^k_{i=1} d(x, x_i)\) is minimum, where \(d\) is a geodesic metric on \(G\). The median function on \(G\) is the function \(M\), defined by \(M(\pi) = \{x |x \text{ is a median of } \pi\}\), whose ...
Fred R. McMorris +2 more
openaire +2 more sources