{"id":"W2964757429","doi":"10.1137/1.9781611976465.45","title":"A Fast Minimum Degree Algorithm and Matching Lower Bound","year":2021,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Degree (music); Heuristics; Combinatorics; Time complexity; Mathematics; Running time; Binary logarithm; Simple (philosophy); Reduction (mathematics); Algorithm; Graph; Upper and lower bounds; Discrete mathematics; Mathematical optimization","routes":{"ca_aff":true,"ca_fund":false,"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.001460202,0.001608382,0.001194854,0.001676545,0.001464982,0.003470743,0.00299708,0.002045159,0.01618937],"category_scores_gemma":[0.009411371,0.0008404516,0.001559418,0.003375026,0.001236972,0.006978838,0.002913466,0.003532221,0.006852625],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002776472,"about_ca_system_score_gemma":0.002627953,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002047335,"about_ca_topic_score_gemma":0.002548643,"domain_scores_codex":[0.9971147,0.0004515596,0.0001242826,0.0007786133,0.001101327,0.0004295128],"domain_scores_gemma":[0.9957147,0.002340812,0.0002412675,0.001000956,0.0005332531,0.0001688631],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004256661,0.0003325157,0.0009452101,0.0005700457,0.00007764894,0.0001546196,0.000174649,0.136232,0.01274614,0.4295624,0.04155711,0.377222],"study_design_scores_gemma":[0.00009585777,0.0001474381,0.0004643029,0.00009453647,0.00004978863,0.0004068295,0.00005609611,0.503787,0.009071055,0.4430555,0.04271667,0.00005480177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0123714,0.001458479,0.9467406,0.001349426,0.0002640765,0.0001651767,0.0004667795,0.001870812,0.0353133],"genre_scores_gemma":[0.1482355,0.001560948,0.8175073,0.0008776688,0.0004208467,0.0003512502,0.001445564,0.001228892,0.02837208],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01618937,"threshold_uncertainty_score":0.05415881,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07690993821574797,"score_gpt":0.2769575518587669,"score_spread":0.2000476136430189,"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."}}