{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006244628,0.000507778,0.0007184094,0.00006629841,0.0004733236,0.0004755985,0.0005330688,0.0007438352,0.00001224738],"category_scores_gemma":[0.00001693235,0.0004741237,0.0004108412,0.00003719487,0.0004174319,0.00007985856,0.0008808695,0.000856173,0.00000422796],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005496842,"about_ca_system_score_gemma":0.0001921484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001003056,"about_ca_topic_score_gemma":0.000001236088,"domain_scores_codex":[0.9977511,0.000007390908,0.0004948626,0.000777916,0.00046912,0.0004996791],"domain_scores_gemma":[0.9982441,0.0005424376,0.0002980702,0.0005888756,0.0001048742,0.0002216523],"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.000009697039,0.00001877434,1.624608e-8,0.0001812123,0.0002027698,0.000005178469,0.001319717,6.704349e-7,0.0002140284,0.8271477,0.0006564651,0.1702438],"study_design_scores_gemma":[0.001341397,0.00009718106,3.148679e-8,0.0002952214,0.00009493801,0.00003646468,0.0004758339,0.00109139,0.0003592979,0.9743912,0.02121698,0.0006000135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003617226,0.0005026074,0.7087227,0.0001725181,0.0004940248,0.002513989,0.0002090438,0.0002230918,0.2868003],"genre_scores_gemma":[0.0001497445,0.0001068304,0.6950324,0.0002438311,0.0009252549,0.0002302719,0.00003805942,0.0001712964,0.3031023],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1696438,"threshold_uncertainty_score":0.9997711,"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."}}