TY  - RPRT
TI  - Typical solution time for a vertex-covering algorithm on finite-connectivity random graphs.
AU  - M Weigt
AU  - A K Hartmann
PY  - 2001
DO  - 10.1103/physrevlett.86.1658
UR  - https://pubmed.ncbi.nlm.nih.gov/11290217/
ID  - 11290217
ER  -