On the public citation graph
Node-weighted graphs having the König-Egerváry property
0 signed · 33 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/bfb0120895openalex-snapshot
Dual integrality in b-matching problems
inferredcites →https://doi.org/10.1016/0012-365x(79)90066-9openalex-snapshot
Independence numbers of graphs-an extension of the Koenig-Egervary theorem
inferredcites →https://doi.org/10.1016/0020-0190(77)90068-0openalex-snapshot
Testing for equality between maximum matching and minimum node covering
inferredcites →https://doi.org/10.1016/0020-0190(78)90016-9openalex-snapshot
An O(|V|3) algorithm for finding maximum flows in networks
inferredcites →https://doi.org/10.1016/0020-0190(79)90002-4openalex-snapshot
A linear-time algorithm for testing the truth of certain quantified boolean formulas
inferredcites →https://doi.org/10.1016/0095-8956(79)90085-6openalex-snapshot
A characterization of the graphs in which the transversal number equals the matching number
inferredcites →https://doi.org/10.1016/0377-2217(81)90247-2openalex-snapshot
Remarks on the requirement matrix of school timetable problems
inferredcites →https://doi.org/10.1057/jors.1981.81openalex-snapshot
Algorithms for Network Programming
inferredcites →https://doi.org/10.1137/0603052openalex-snapshot
Vertices Belonging to All or to No Maximum Stable Sets of a Graph
inferredcites →https://doi.org/10.4153/cjm-1954-033-3openalex-snapshot
A Short Proof of the Factor Theorem for Finite Graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-61576-8_83openalex-snapshot
Constructive — non-constructive approximation and maximum independent set problem
inferred← citeshttps://doi.org/10.1007/bf01580775openalex-snapshot
An extension of the könig-egerváry property to node-weighted bidirected graphs
inferred← citeshttps://doi.org/10.1007/bfb0083461openalex-snapshot
Quadratic functions of binary variables
inferred← citeshttps://doi.org/10.1007/s00373-011-1037-yopenalex-snapshot
Critical Independent Sets and König–Egerváry Graphs
inferred← citeshttps://doi.org/10.1007/s00373-012-1196-5openalex-snapshot
When is G 2 a König–Egerváry Graph?
inferred← citeshttps://doi.org/10.1007/s00373-014-1483-4openalex-snapshot
Polynomial Time Recognition of Essential Graphs Having Stability Number Equal to Matching Number
inferred← citeshttps://doi.org/10.1007/s10801-020-00968-xopenalex-snapshot
On the critical difference of almost bipartite graphs
inferred← citeshttps://doi.org/10.1007/s10878-007-9112-2openalex-snapshot
Probabilistic graph-coloring in bipartite and split graphs
inferred← citeshttps://doi.org/10.1007/s40590-025-00796-8openalex-snapshot
On König–Egerváry corona graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90273-dopenalex-snapshot
König-Egerváry graphs, 2-bicritical graphs and fractional matchings
inferred← citeshttps://doi.org/10.1016/b978-0-08-040806-4.50007-1openalex-snapshot
BOOLEAN-COMBINATORIAL BOUNDING OF MAXIMUM 2-SATISFIABILITY
inferred← citeshttps://doi.org/10.1016/j.dam.2007.03.026openalex-snapshot
Crown reductions for the Minimum Weighted Vertex Cover problem
inferred← citeshttps://doi.org/10.1016/j.dam.2013.01.005openalex-snapshot
On maximum matchings in König–Egerváry graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2016.05.012openalex-snapshot
Two more characterizations of König–Egerváry graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.01.022openalex-snapshot
On almost bipartite non-König–Egerváry graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2011.09.092openalex-snapshot
A Characterization of König–Egerváry Graphs Using a Common Property of All Maximum Matchings
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00528-9openalex-snapshot
On α+-stable König–Egerváry graphs
inferred← citeshttps://doi.org/10.1016/s0167-6377(96)00038-7openalex-snapshot
A combinatorial column generation algorithm for the maximum stable set problem
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00005-6openalex-snapshot
A priori optimization for the probabilistic maximum independent set problem
inferred← citeshttps://doi.org/10.1016/s0377-2217(96)00271-8openalex-snapshot
A generalization of König-Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios
inferred← citeshttps://doi.org/10.1145/254180.254190openalex-snapshot
A survey of approximately optimal solutions to some covering and packing problems
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.