On the public citation graph

Robust recoverable perfect matchings

https://doi.org/10.1002/net.21624
0 signed · 29 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/net.20187openalex-snapshot
Matching preclusion for some interconnection networks
inferredcites →https://doi.org/10.1002/net.20440openalex-snapshot
Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions
inferredcites →https://doi.org/10.1002/net.20441openalex-snapshot
Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper‐stars
inferredcites →https://doi.org/10.1016/j.dam.2010.06.006openalex-snapshot
Matching interdiction
inferredcites →https://doi.org/10.1016/j.dam.2012.03.040openalex-snapshot
Matching preclusion and conditional matching preclusion for regular interconnection networks
inferredcites →https://doi.org/10.1016/j.dam.2012.10.002openalex-snapshot
Strong matching preclusion under the conditional fault model
inferredcites →https://doi.org/10.1016/j.dam.2013.06.011openalex-snapshot
Strong matching preclusion for k -ary n -cubes
inferredcites →https://doi.org/10.1016/j.disc.2009.01.006openalex-snapshot
Blockers and transversals
inferredcites →https://doi.org/10.1016/j.disc.2009.08.009openalex-snapshot
Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid
inferredcites →https://doi.org/10.1016/j.tcs.2011.08.008openalex-snapshot
Strong matching preclusion
inferredcites →https://doi.org/10.1016/j.tcs.2011.12.065openalex-snapshot
On the NP-completeness of the perfect matching free subgraph problem
inferredcites →https://doi.org/10.1016/j.tcs.2012.09.020openalex-snapshot
Matching preclusion for balanced hypercubes
inferredcites →https://doi.org/10.1090/chel/367openalex-snapshot
Matching Theory
inferredcites →https://doi.org/10.1142/s0129054108006364openalex-snapshot
MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
inferredcites →https://doi.org/10.1142/s0129626412500053openalex-snapshot
MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES
inferredcites →https://doi.org/10.1142/s0219265910002726openalex-snapshot
MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR AUGMENTED CUBES

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/rnc.4603openalex-snapshot
Minimal structural perturbations for controllability of a networked system: Complexities and approximations
inferred← citeshttps://doi.org/10.1007/978-3-031-55598-5_21openalex-snapshot
The Complexity Classes of Hamming Distance Recoverable Robust Problems
inferred← citeshttps://doi.org/10.1007/978-3-031-98740-3_27openalex-snapshot
Recoverable Robust Cardinality Constrained Maximization with Commitment of a Submodular Function
inferred← citeshttps://doi.org/10.1016/j.dam.2025.04.042openalex-snapshot
Higher order matching preclusion for regular interconnection networks
inferred← citeshttps://doi.org/10.1016/j.ejcon.2024.101090openalex-snapshot
On verification and design of input matrix for robust linear systems: Complexity and polynomially solvable cases
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103796openalex-snapshot
Parameterized complexity of submodular minimization under uncertainty
inferred← citeshttps://doi.org/10.1016/j.orl.2022.05.001openalex-snapshot
A parameterized view to the robust recoverable base problem of matroids under structural uncertainty
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.06.050openalex-snapshot
Matching preclusion number in product graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.05.022openalex-snapshot
A note on generalized matching preclusion in bipartite graphs
inferred← citeshttps://doi.org/10.1109/cdc.2017.8263985openalex-snapshot
On the edge insertion/deletion and controllability distance of linear structural systems
inferred← citeshttps://doi.org/10.1137/20m1336229openalex-snapshot
How to Secure Matchings against Edge Failures
inferred← citeshttps://doi.org/10.1142/s0219265919400061openalex-snapshot
A Concise Survey of Matching Preclusion in Interconnection Networks
inferred← citeshttps://doi.org/10.20429/tag.2018.050101openalex-snapshot
Generalized Matching Preclusion in Bipartite Graphs
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.