Results 91 to 100 of about 5,839 (198)

The Generalized 3-Connectivity of Exchanged Folded Hypercubes

Axioms
For S⊆V(G),κG(S) denotes the maximum number k of edge disjoint trees T1,T2,…,Tk in G, such that V(Ti)∩V(Tj)=S for any i,j∈{1,2,…,k} and i≠j. For an integer 2≤r≤|V(G)|, the generalized r-connectivity of G is defined as κr(G)=min{κG(S)|S⊆V(G)and|S|=r}.
Wantao Ning, Hao Li
doaj   +1 more source

Efficient distributed schemes for embedding binary trees into incomplete hypercubes

, 2011
[[abstract]]Presents two fundamental schemes to embed four types of tree topologies (complete binary trees, two-rooted complete binary trees, Fibonacci search binary trees and incomplete binary trees) into incomplete hypercubes with a dilation of 1.
Yeh, Yao-Ming;Shyu, Yiu-Cheng
core  

Homogeneity properties of hypercubes [PDF]

, 2007
The paper reviews properties of hypercubes of arbitrary dimension from the metric geometry point of view. It is shown, in particular, that a hypercube is a homogeneous metric space with respect to a class of partial cubes.
Ovchinnikov, Sergei
core  

TOPOLOGICAL INDICES IN HYPERTUBES OF HYPERCUBES

Studia Universitatis Babes-Bolyai Chemia, 2016
A topological index is a single number descriptor that characterizes the molecular graph topology up to isomorphism. Hyper-tubes, open or closed, consisting of hyper-cubes of n-dimensions have been designed and formulas for some topological indices ...
Khadijeh FATHALIKHANI, Atena PÎRVAN-MOLDOVAN, Mircea V. DIUDEA   +2 more
doaj  

Hypercubes and Compromise Values for Cooperative Fuzzy Games [PDF]

AMS classification: 90D12; 03E72;cooperative games;Compromise values;Core;Fuzzy coalitions;Fuzzy games;Hypercubes;Path solutions;Weber ...
Brânzei, R., Tijs, S.H., Dimitrov, D.A.
core  

Random Walks on Clifford Algebras as Directed Hypercubes

, 2008
International audienceGiven a Clifford algebra of arbitrary signature $Cl_{p+q}=n$ multiplicative random walks are induced by sequences of independent, uniformly distributed random variables taking values in the unit basis paravectors in the algebra ...
Staples, Stacey, Schott, René
core  

Randomly twisted hypercubes: between structure and randomness [PDF]

Twisted hypercubes are generalizations of the Boolean hypercube, obtained by iteratively connecting two instances of a graph by a uniformly random perfect matching. Dudek et al.
Zhukovskii, M., Dikstein, Y., Benjamini, I., Gross, R.   +3 more
core   +2 more sources

Polytope: an algorithm for efficient feature extraction on hypercubes

Journal of Big Data
Data extraction algorithms on data hypercubes, or datacubes, are traditionally only capable of cutting boxes of data along the datacube axes. For many use cases however, this returns much more data than users actually need, leading to an unnecessary ...
Mathilde Leuridan, James Hawkes, Simon Smart, Emanuele Danovaro, Martin Schultz, Tiago Quintino   +5 more
doaj   +1 more source

Two-terminal reliability of hypercubes

, 1991
Two-terminal reliability is an important parameter in the design of reliable networks. The two-terminal reliability analysis problem for general stochastic networks is in the #P-complete class of computationally difficult problems.
Trahan, Jerry L., Ahmed, Riaz M.
core  

An Optimal d-1-Fault-Tolerant Broadcasting Scheme for d-Dimensional Hypercubes

, 1994
Broadcasting is the process of information dissemination in a communication network in which a message, originated by one member, is transmitted to all members of the network.
Siu-cheung Chau
core