On the public citation graph

Exact and approximative algorithms for coloring G(n,p)

https://doi.org/10.1002/rsa.20007
0 signed · 37 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/9781118032718openalex-snapshot
Random Graphs
inferredcites →https://doi.org/10.1006/jcss.2001.1773openalex-snapshot
Heuristics for Semirandom Graph Problems
inferredcites →https://doi.org/10.1006/jctb.1996.0036openalex-snapshot
Sudden Emergence of a Giantk-Core in a Random Graph
inferredcites →https://doi.org/10.1007/3-540-36494-3_45openalex-snapshot
Finding Large Independent Sets in Polynomial Expected Time
inferredcites →https://doi.org/10.1007/3-540-44693-1_26openalex-snapshot
Efficient Recognition of Random Unsatisfiable k-SAT Instances by Spectral Methods
inferredcites →https://doi.org/10.1007/3-540-45061-0_18openalex-snapshot
MAX k-CUT and Approximating the Chromatic Number of Random Graphs
inferredcites →https://doi.org/10.1007/3-540-48224-5_26openalex-snapshot
Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently
inferredcites →https://doi.org/10.1007/978-3-0348-8211-8_11openalex-snapshot
Coloring Random Graphs — an Algorithmic Perspective
inferredcites →https://doi.org/10.1007/978-3-540-45077-1_3openalex-snapshot
Certifying Unsatisfiability of Random 2k-SAT Formulas Using Approximation Techniques
inferredcites →https://doi.org/10.1007/978-3-540-45198-3_20openalex-snapshot
The Lovász Number of Random Graphs
inferredcites →https://doi.org/10.1007/978-3-642-97881-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/bf02579314openalex-snapshot
The asymptotic behaviour of lovász’ ϑ function for random graphs
inferredcites →https://doi.org/10.1007/bf02579329openalex-snapshot
The eigenvalues of random symmetric matrices
inferredcites →https://doi.org/10.1016/0020-0190(76)90065-xopenalex-snapshot
A note on the complexity of the chromatic number problem
inferredcites →https://doi.org/10.1016/0196-6774(91)90040-6openalex-snapshot
The greedy coloring is a bad probabilistic algorithm
inferredcites →https://doi.org/10.1016/s0020-0190(01)00187-9openalex-snapshot
Deciding k-colorability in expected polynomial time
inferredcites →https://doi.org/10.1016/s0020-0190(98)00092-1openalex-snapshot
Coloring random graphs
inferredcites →https://doi.org/10.1016/s1571-0653(04)00461-5openalex-snapshot
Recognizing more random unsatisfiable 3-SAT instances efficiently
inferredcites →https://doi.org/10.1017/cbo9780511814068openalex-snapshot
Random Graphs
inferredcites →https://doi.org/10.1017/s0305004100051124openalex-snapshot
On colouring random graphs
inferredcites →https://doi.org/10.1023/a:1013899527204openalex-snapshot
Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time
inferredcites →https://doi.org/10.1109/ccc.1996.507690openalex-snapshot
Zero knowledge and the chromatic number
inferredcites →https://doi.org/10.1109/sfcs.1995.492575openalex-snapshot
3-coloring in time 0(1.3446/sup n/): a no-MIS algorithm
inferredcites →https://doi.org/10.1145/509907.509940openalex-snapshot
Almost all graphs with average degree 4 are 3-colorable
inferredcites →https://doi.org/10.37236/1193openalex-snapshot
The Sandwich Theorem

What points at this work

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

inferred← citeshttps://doi.org/10.1002/rsa.20096openalex-snapshot
MAXk‐CUT and approximating the chromatic number of random graphs
inferred← citeshttps://doi.org/10.1002/rsa.20116openalex-snapshot
A spectral heuristic for bisecting random graphs
inferred← citeshttps://doi.org/10.1002/rsa.v29:3openalex-snapshot
inferred← citeshttps://doi.org/10.1007/3-540-32743-6_3openalex-snapshot
Zufällige Graphen
inferred← citeshttps://doi.org/10.1016/j.disc.2008.09.038openalex-snapshot
A note on coloring sparse random graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.05.004openalex-snapshot
An improved algorithm for approximating the chromatic number of
inferred← citeshttps://doi.org/10.1016/j.jcss.2013.06.003openalex-snapshot
Average-case complexity of backtrack search for coloring sparse random graphs
inferred← citeshttps://doi.org/10.1016/j.sysarc.2015.06.002openalex-snapshot
Message scheduling for real-time interprocessor communication
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.07.017openalex-snapshot
Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2 k -SAT
inferred← citeshttps://doi.org/10.1017/s0963548306007553openalex-snapshot
Finding Large Independent Sets in Polynomial Expected Time
inferred← citeshttps://doi.org/10.1017/s096354830600784xopenalex-snapshot
Strong Refutation Heuristics for Random k -SAT
inferred← citeshttps://doi.org/10.1137/100797503openalex-snapshot
On the Insertion Time of Cuckoo Hashing
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.