Results 21 to 30 of about 1,312,788 (294)
Data Allocation Algorithm for Large Data with All-to-all Comparison Based on Graph Covering [PDF]
Jisuanji gongcheng, 2018 In the process of distributed processing of all-to-all comparison problem for large data,the existing data allocation strategies think less of the special dependency between the comparison task and the data,which lead to the low storage efficiency and ...
GAO Yanjun,ZHANG Xueying,LI Fenglian,TIAN Yuchu
doaj +1 more source
, 2008 We study problems that arise in the context of covering certain geometric objects called seeds (e.g., points or disks) by a set of other geometric objects called cover (e.g., a set of disks or homothetic triangles). We insist that the interiors of the seeds and the cover elements are pairwise disjoint, respectively, but they can touch.
Nieves Atienza +13 more
openaire +9 more sources
Extensions to emergency vehicle location models [PDF]
, 2003 This paper is concerned with extending models for the Maximal Covering Location Problem in two ways. First, the usual 0-1 coverage definition is replaced by the probability of covering a demand within the target time.
Rand, G K, Alsalloum, O I
core +4 more sources
PELABELAN SELIMUT TOTAL SUPER (a,d)-H ANTIMAGIC PADA GRAPH LOBSTER BERATURAN L_n (q,r)
E-Jurnal Matematika, 2017 Graph labelling is a function that maps graph elements to positive integers. A covering of graph is family subgraph from , for with integer k. Graph admits covering if for every subgraph is isomorphic to a graph .
TIRA CATUR ROSALIA +2 more
doaj +1 more source
Some inequalities involving the distance signless Laplacian eigenvalues of graphs [PDF]
Transactions on Combinatorics, 2021 Given a simple graph $G$, the distance signlesss Laplacian $D^{Q}(G)=Tr(G)+D(G)$ is the sum of vertex transmissions matrix $Tr(G)$ and distance matrix $D(G)$.
Abdollah Alhevaz +3 more
doaj +1 more source
Journal of Combinatorial Theory, Series B, 1997 A covering projection from a graph \(G\) onto a graph \(H\) is a ``local isomorphism'': a mapping from the vertex set of \(G\) onto the vertex set of \(H\) such that, for every \(v\in V(G)\), the neighborhood of \(v\) is mapped bijectively onto the neighborhood (in \(H\)) of the image of \(v\).
Jan Kratochvíl +2 more
openaire +1 more source
Homotopy Covers of Graphs and Lifting Property
Wasit Journal for Pure Sciences, 2023 The aim of this paper We create requirements for a graph cover to have the homotopy lifting property of topological space covers, or A-Homotopy lifting property.
salwan abdlwahab, Daher W. Al Baydli
doaj +1 more source
A Variation of Decomposition Under a Length Constraint [PDF]
, 2011 Introducing and initiating a study of a new variation of decomposition namely equiparity induced path decomposition of a graph which is defined to be a decomposition in which all the members are induced paths having same ...
Joseph, Mayamma +3 more
core +1 more source
Exact information ratios for secret sharing on small graphs with girth at least 5
Journal of Mathematical Cryptology, 2019 In a secret-sharing scheme, a piece of information – the secret – is distributed among a finite set of participants in such a way that only some predefined coalitions can recover it.
Harsányi Károly, Ligeti Péter
doaj +1 more source
Coverability of Graphs by Parity Regular Subgraphs
Mathematics, 2021 A graph is even (resp. odd) if all its vertex degrees are even (resp. odd). We consider edge coverings by prescribed number of even and/or odd subgraphs.
Mirko Petruševski, Riste Škrekovski
doaj +1 more source