{"id":"W1978372231","doi":"10.1016/j.orl.2009.01.010","title":"An edge-reduction algorithm for the vertex cover problem","year":2009,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Vertex cover; Edge cover; Cover (algebra); Vertex (graph theory); Feedback vertex set; Reduction (mathematics); Algorithm; Combinatorics; Mathematics; Upper and lower bounds; Approximation algorithm; Graph","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001105145,0.00009829991,0.00008241613,0.0001889647,0.001611237,0.0009925214,0.001175393,0.00003661465,0.00002641771],"category_scores_gemma":[0.00003903967,0.0000736262,0.00006384018,0.00075845,0.0001677382,0.001046263,0.0000741687,0.0003013314,0.00005349814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007049897,"about_ca_system_score_gemma":0.0001058072,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008477791,"about_ca_topic_score_gemma":0.00001382454,"domain_scores_codex":[0.9983429,0.0001948935,0.0001601521,0.0003797634,0.0005001026,0.0004221694],"domain_scores_gemma":[0.9987264,0.0001552679,0.00001106535,0.0007221607,0.0002903654,0.00009477289],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004503968,0.0001759926,0.000001278861,0.000002861115,0.00001897841,0.000002843628,0.0008386603,0.01598244,0.01712725,0.07424286,0.04204164,0.8495607],"study_design_scores_gemma":[0.0002496896,0.000244064,0.0002098261,0.000007844828,0.000002748042,0.00001530807,0.00006302373,0.9709917,0.001650685,0.003934165,0.02251053,0.0001204259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001796136,0.00006459224,0.944539,0.05217448,0.000290363,0.0008025132,0.000009428758,0.00008286833,0.0002406311],"genre_scores_gemma":[0.1733306,0.00006806751,0.8190526,0.004834833,0.0009531919,0.0005714772,0.00005173256,0.00002016964,0.001117301],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9550093,"threshold_uncertainty_score":0.9996885,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05798311254050664,"score_gpt":0.3598596864221159,"score_spread":0.3018765738816093,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}