The Conditional Strong Matching Preclusion of Augmented Cubes [PDF]
Theory and Applications of Graphs, 2021 The strong matching preclusion is a measure for the robustness of interconnection networks in the presence of node and/or link failures. However, in the case of random link and/or node failures, it is unlikely to find all the faults incident and/or ...
Abdallah, Mohamad, Cheng, Eddie
core +5 more sources
Rational experiment design for sequencing-based RNA structure mapping. [PDF]
RNA, 2014 Structure mapping is a classic experimental approach for determining nucleic acid structure that has gained renewed interest in recent years following advances in chemistry, genomics, and informatics. The approach encompasses numerous techniques that use
Aviran S, Pachter L.
europepmc +3 more sources
Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper‐stars [PDF]
Networks, 2012 The matching preclusion number of a graph with an even number of vertices is the minimum number of edges whose deletion results in a graph that has no perfect matchings. For many interconnection networks, the optimal sets are precisely those induced by a
Brigham +15 more
core +4 more sources
Conditional Strong Matching Preclusion of the Alternating Group Graph [PDF]
Theory and Applications of Graphs, 2019 The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings.
Abdallah, Mohamad, Cheng, Eddie
core +6 more sources
Conditional Matching Preclusion Number of Graphs
Discrete Dynamics in Nature and Society, 2023 The conditional matching preclusion number of a graph G , denoted by m p
Yalan Li, Shumin Zhang, Chengfu Ye
openaire +2 more sources
Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions [PDF]
Networks, 2011 AbstractThe matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost‐perfect matchings. For many interconnection networks, the optimal sets are precisely those induced by a single vertex.
Cheng, Eddie +3 more
openaire +3 more sources
Matching preclusion and conditional matching preclusion for hierarchical cubic networks
AIMS Mathematics, 2022 <abstract><p>Matching preclusion originates from the measurement of interconnection network robustness in the event of edge failure. Conditional matching preclusion belongs to generalized matching preclusion. We obtain the matching preclusion number and conditional matching preclusion number for hierarchical cubic network($ HCN_n ...
Jinyu Zou, Haizhen Ren
openaire +2 more sources
Robust Assignments via Ear Decompositions and Randomized Rounding [PDF]
, 2016 Many real-life planning problems require making a priori decisions before all parameters of the problem have been revealed. An important special case of such problem arises in scheduling problems, where a set of tasks needs to be assigned to the ...
Adjiashvili, David +2 more
core +2 more sources
Ruling out higher-order interference from purity principles [PDF]
, 2017 As first noted by Rafael Sorkin, there is a limit to quantum interference. The interference pattern formed in a multi-slit experiment is a function of the interference patterns formed between pairs of slits, there are no genuinely new features resulting ...
Barnum, Howard +3 more
core +6 more sources
Matching preclusion and conditional matching preclusion for regular interconnection networks
Discrete Applied Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cheng, Eddie +2 more
openaire +1 more source