On the public citation graph
A Tight Analysis of the Maximal Matching Heuristic
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/11533719_71openalex-snapshot
A Tight Analysis of the Maximal Matching Heuristic
inferredcites →https://doi.org/10.1007/978-3-540-24587-2_43openalex-snapshot
Approximation Hardness of Minimum Edge Dominating Set and Minimum Maximal Matching
inferredcites →https://doi.org/10.1007/978-3-642-58300-1_11openalex-snapshot
On Some Approximation Algorithms for Dense Vertex Cover Problem
inferredcites →https://doi.org/10.1007/bf00290149openalex-snapshot
Ramsey numbers and an approximation algorithm for the vertex cover problem
inferredcites →https://doi.org/10.1007/bf03167363openalex-snapshot
An approximation of the minimum vertex cover in a graph
inferredcites →https://doi.org/10.1016/0022-0000(91)90023-xopenalex-snapshot
Optimization, approximation, and complexity classes
inferredcites →https://doi.org/10.1016/s0097-8485(99)00031-5openalex-snapshot
Variable neighborhood search for extremal graphs
inferredcites →https://doi.org/10.1016/s0304-0208(08)73101-3openalex-snapshot
A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem
inferredcites →https://doi.org/10.1016/s0304-3975(97)00226-0openalex-snapshot
Improved non-approximability results for minimum vertex cover with density constraints
inferredcites →https://doi.org/10.1090/dimacs/040/11openalex-snapshot
Approximating dense cases of covering problems
inferredcites →https://doi.org/10.1090/dimacs/069/13openalex-snapshot
Variable neighborhood search for extremal graphs. 9. Bounding the irregularity of a graph
inferredcites →https://doi.org/10.1137/s0097539700381097openalex-snapshot
Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
inferredcites →https://doi.org/10.1145/1597036.1597045openalex-snapshot
A better approximation ratio for the vertex cover problem
inferredcites →https://doi.org/10.1145/258533.258536openalex-snapshot
Some optimal inapproximability results
inferredcites →https://doi.org/10.5555/1070432.1070513openalex-snapshot
Approximating vertex cover on dense 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/11970125_9openalex-snapshot
Improved Approximation Bounds for Edge Dominating Set in Dense Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-85363-3_4openalex-snapshot
Connected Vertex Covers in Dense Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-02882-3_37openalex-snapshot
Why Locally-Fair Maximal Flows in Client-Server Networks Perform Well
inferred← citeshttps://doi.org/10.1007/978-3-642-20877-5_5openalex-snapshot
Approximating Edge Dominating Set in Dense Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-37502-6_100openalex-snapshot
Algorithmic Tile Self-Assembly for Solving the Maximal Matching Problem
inferred← citeshttps://doi.org/10.1007/s10878-010-9321-yopenalex-snapshot
Why locally-fair maximal flows in client-server networks perform well
inferred← citeshttps://doi.org/10.1007/s11590-011-0351-xopenalex-snapshot
Integer programming formulations for the minimum weighted maximal matching problem
inferred← citeshttps://doi.org/10.1007/s40595-016-0066-0openalex-snapshot
Maximal assortative matching for real-world network graphs, random network graphs and scale-free network graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2007.09.005openalex-snapshot
Facet defining inequalities among graph invariants: The system GraPHedron
inferred← citeshttps://doi.org/10.1016/j.disc.2020.112243openalex-snapshot
Bounding and approximating minimum maximal matchings in regular graphs
inferred← citeshttps://doi.org/10.1016/j.jksuci.2015.10.004openalex-snapshot
Maximal assortative matching for complex network graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.03.021openalex-snapshot
Connected vertex covers in dense graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.10.001openalex-snapshot
Approximating edge dominating set in dense graphs
inferred← citeshttps://doi.org/10.1093/comjnl/bxv102openalex-snapshot
Maximal Assortative Matching and Maximal Dissortative Matching for Complex Network Graphs
inferred← citeshttps://doi.org/10.1145/1671970.1865971openalex-snapshot
Analytical and experimental comparison of six algorithms for the vertex cover problem
inferred← citeshttps://doi.org/10.37236/9963openalex-snapshot
Minimum Maximal Matchings in Cubic Graphs
showing the first 16 of 17 · page through all 17
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.