Results 21 to 30 of about 5,839 (198)
Adaptive Video Transmission Using Residue Octree Cubes
Computers, 2014 This paper proposes a method of transmitting video streaming data based on downsampling-upsampling pyramidal decomposition. By implementing an octal tree decomposition of the frame cubes, prior to transforming them into hypercubes, the algorithm manages ...
Adrian Enache, Costin-Anton Boiangiu
doaj +1 more source
Journal of Graph Theory, 2023 AbstractLet be the hypercube of dimension and let and be subsets of the vertex set , called configurations in . We say that is an exact copy of if there is an automorphism of which sends onto . Let be an integer, let be a configuration in and let be a configuration in .
John L. Goldwasser, Ryan Hansen
openaire +3 more sources
Structure connectivity of hypercubes
AKCE International Journal of Graphs and Combinatorics, 2018 The connectivity of a graph is an important measurement for the fault-tolerance of the network. To provide more accurate measures for the fault-tolerance of networks than the connectivity, some generalizations of connectivity have been introduced. Let be
S.A. Mane
doaj +2 more sources
The Minimum Spectral Radius of an Edge-Removed Network: A Hypercube Perspective
Discrete Dynamics in Nature and Society, 2017 The spectral radius minimization problem (SRMP), which aims to minimize the spectral radius of a network by deleting a given number of edges, turns out to be crucial to containing the prevalence of an undesirable object on the network.
Yingbo Wu +3 more
doaj +1 more source
Counting hypercubes in hypercubes
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Graphs obtained from collections of blocks
Electronic Journal of Graph Theory and Applications, 2015 Given a collection of $d$-dimensional rectangular solids called blocks, no two of which sharing interior points, construct a block graph by adding a vertex for each block and an edge if the faces of the two corresponding blocks intersect nontrivially ...
Colton Magnant +2 more
doaj +1 more source
Graphs and CombinatoricsAbstract A subset M of vertices in a graph G is a mutual-visibility set if any two vertices u and v in M “see” each
Maria Axenovich, Dingyuan Liu
openaire +4 more sources
Equiorthogonal Frequency Hypercubes: Preliminary Theory
, 1998 Using a strong definition of frequency hypercube, we define a strengthened form of orthogonality, called equiorthogonality, for sets of such hypercubes.
Morgan, Ilene H.
core +1 more source
Common Sub-Trajectory Clustering via Hypercubes in Spatiotemporal Space
IEEE Access, 2020 Conventional sub-trajectory clustering is used to identify similarities among multiple trajectories. Existing methods tend to overlook many of the relevant sub-trajectories; others require a road network as input; all are significantly slowed down ...
Oscar Lijen Hsu, Che-Rung Lee
doaj +1 more source
Disjoint cycles and spanning graphs of hypercubes
, 2004 The aim of this paper is to prove that double starlike trees are embedable into hypercubes, which answers an open question posed by Ivan Havel (Časopis Pěst. Mat. 109 (1984) 135). For this, a theorem about partitioning the hypercubes into vertex-disjoint
Mollard, Michel, Kobeissi, Mohamed
core +1 more source