Results 31 to 40 of about 613,936 (286)
Availability analysis of resilient geometric routing on Internet topology [PDF]
, 2014 Scalable routing schemes for large-scale networks, especially future Internet, are required. Geometric routing scheme is a promising candidate to solve the scalability issue of routing tables in conventional IP routing based on longest prefix matching ...
Sahhaf, Seyedeh Sahel +4 more
core +1 more source
Protection of graphs with emphasis on Cartesian product graphs
Filomat, 2019 In this paper we study the weak Roman domination number and the secure domination number of a graph. In particular, we obtain general bounds on these two parameters and, as a consequence of the study, we derive new inequalities of Nordhaus-Gaddum type involving secure domination and weak Roman domination.
Valveny, Magdalena +1 more
openaire +3 more sources
A dynamic domination problem in trees [PDF]
Transactions on Combinatorics, 2015 We consider a dynamic domination problem for graphs in which an infinite sequence of attacks occur at vertices with guards and the guard at the attacked vertex is required to vacate the vertex by moving to a neighboring vertex with no guard. Other guards
William Klostermeyer, Christina Mynhardt
doaj
IEEE Access, 2018 In the field of software protection, when there is a dependence between the various software protection technologies, the application order of these technologies must be arranged in a correct way in order to maximize the protection effect.
Qing Su, Fan He, Naiqi Wu, Zhiyi Lin
doaj +1 more source
Efficient pruning of large knowledge graphs [PDF]
, 2018 In this paper we present an efficient and highly accurate algorithm to prune noisy or over-ambiguous knowledge graphs given as input an extensional definition of a domain of interest, namely as a set of instances or concepts. Our method climbs the graph
Faralli, Stefano +3 more
core +2 more sources
Data Reconstruction Attack for Vertical Graph Federated Learning [PDF]
Jisuanji kexue, 2023 Recently,data privacy protection regulations restrict the direct exchange of raw data between different graph data ow-ners,resulting in the phenomenon of “data silos”.To solve this problem,vertical federated learning graph neural network realizes ...
LI Rongchang, ZHENG Haibin, ZHAO Wenhong, CHEN Jinyin
doaj +1 more source
Dual Protection Routing Trees on Graphs
Mathematics, 2023 In IP networks, packet forwarding is destination-based and hop-by-hop, and routes are built as needed. Kwong et al. introduced a protection routing in which packet delivery to the destination node can proceed uninterrupted in the event of any single node or link failure.
openaire +2 more sources
An Integrated Knowledge Graph to Automate Cloud Data Compliance
IEEE Access, 2020 To address data protection concerns, authorities and standards bodies worldwide have released a plethora of regulations, guidelines, and software controls to be applied to Cloud data.
Karuna Pande Joshi +2 more
doaj +1 more source
Interdependent policy instrument preferences: a two-mode network approach [PDF]
, 2018 In policymaking, actors are likely to take the preferences of others into account when strategically positioning themselves. However, there is a lack of research that conceives of policy preferences as an interdependent system.
Bressers +18 more
core +1 more source
Disjoint Dominating Sets with a Perfect Matching
, 2017 In this paper, we consider dominating sets $D$ and $D'$ such that $D$ and $D'$ are disjoint and there exists a perfect matching between them. Let $DD_{\textrm{m}}(G)$ denote the cardinality of smallest such sets $D, D'$ in $G$ (provided they exist ...
Ayello, Alejandro Angeli +2 more
core +1 more source