On the public citation graph
Complexity and Algorithm for the Matching Cutset Problem
0 signed · 25 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4614-1701-9openalex-extracted
Design and Analysis of Approximation Algorithms
inferredcites →https://doi.org/10.1007/s40840-019-00827-4openalex-extracted
Structure and Substructure Connectivity of Balanced Hypercubes
inferredcites →https://doi.org/10.1016/0012-365x(85)90051-2openalex-extracted
Decomposition by clique separators
inferredcites →https://doi.org/10.1016/0012-365x(88)90058-1openalex-extracted
The connected cutset connectivity of a graph
inferredcites →https://doi.org/10.1016/0020-0190(81)90072-7openalex-extracted
An algorithm for finding clique cut-sets
inferredcites →https://doi.org/10.1016/0095-8956(73)90059-2openalex-extracted
Smallest maximal matchings in the graph of the d-dimensional cube
inferredcites →https://doi.org/10.1016/0095-8956(85)90049-8openalex-extracted
Star-cutsets and perfect graphs
inferredcites →https://doi.org/10.1016/j.ajmsc.2019.10.001openalex-extracted
Structure and substructure connectivity of circulant graphs and hypercubes
inferredcites →https://doi.org/10.1016/j.akcej.2018.01.009openalex-extracted
Structure connectivity of hypercubes
inferredcites →https://doi.org/10.1016/j.amc.2020.125639openalex-extracted
Structure and substructure connectivity of alternating group graphs
inferredcites →https://doi.org/10.1016/j.dam.2020.04.009openalex-extracted
Structure connectivity and substructure connectivity of star graphs
inferredcites →https://doi.org/10.1016/j.ins.2017.11.047openalex-extracted
Structure connectivity and substructure connectivity of k-ary n-cube networks
inferredcites →https://doi.org/10.1016/j.tcs.2016.04.014openalex-extracted
Structure connectivity and substructure connectivity of hypercubes
inferredcites →https://doi.org/10.1016/j.tcs.2019.09.007openalex-extracted
Structure connectivity and substructure connectivity of twisted hypercubes
inferredcites →https://doi.org/10.1016/j.tcs.2020.10.028openalex-extracted
Structure connectivity and substructure connectivity of wheel networks
inferredcites →https://doi.org/10.1016/j.tcs.2021.05.033openalex-extracted
Structure and substructure connectivity of divide-and-swap cube
inferredcites →https://doi.org/10.1016/s0166-218x(00)00197-9openalex-extracted
On stable cutsets in graphs
inferredcites →https://doi.org/10.1080/17445760.2021.1941006openalex-extracted
Star structure connectivities of pancake graphs and burnt pancake graphs
inferredcites →https://doi.org/10.1109/pic.2018.8706296openalex-extracted
Structure Connectivity and Substructure Connectivity of Alternating Group Graphs
inferredcites →https://doi.org/10.1112/jlms/s1-10.37.26openalex-extracted
On Representatives of Subsets
inferredcites →https://doi.org/10.1137/0202019openalex-extracted
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
inferredcites →https://doi.org/10.4153/cjm-1956-045-5openalex-extracted
Maximal Flow Through a Network
inferredcites →https://doi.org/10.6028/jres.069b.013openalex-extracted
Maximum matching and a polyhedron with 0,1-vertices
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.