{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008107148,0.001271755,0.001692529,0.001936372,0.001539305,0.00287313,0.003269779,0.002256257,0.009560433],"category_scores_gemma":[0.004431932,0.00073651,0.002045238,0.002774249,0.001001357,0.003867498,0.003157495,0.003157036,0.00237938],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001525391,"about_ca_system_score_gemma":0.002310578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002809659,"about_ca_topic_score_gemma":0.003377288,"domain_scores_codex":[0.9985216,0.0003245636,0.00007165292,0.0003053081,0.0004850057,0.000291775],"domain_scores_gemma":[0.9973664,0.001461294,0.0001036821,0.0005896699,0.0003010295,0.0001780183],"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.001516298,0.001361046,0.001606569,0.0006125284,0.0002113077,0.0003181878,0.0005143435,0.1057967,0.01614453,0.1006228,0.05029872,0.7209969],"study_design_scores_gemma":[0.0005569652,0.0002721103,0.001459855,0.00008003944,0.0002100201,0.0004846489,0.0002782019,0.6715924,0.01025101,0.2967095,0.01803332,0.00007197401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0943654,0.001035079,0.8603535,0.002599451,0.0004295281,0.000681981,0.001241294,0.00390468,0.03538908],"genre_scores_gemma":[0.2535157,0.0006146948,0.7252374,0.0006366468,0.0003050036,0.0005798443,0.003684311,0.0007201773,0.01470623],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009560433,"threshold_uncertainty_score":0.03198284,"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."}}