{"id":"W2093941744","doi":"10.1016/s0020-0190(03)00228-x","title":"From a simple elimination ordering to a strong elimination ordering in linear time","year":2003,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Simple (philosophy); Chordal graph; Mathematics; Time complexity; Graph; Computer science; Combinatorics; Algorithm","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":[],"consensus_categories":[],"category_scores_codex":[0.0005721982,0.0001496433,0.0001329858,0.000633991,0.0001706321,0.0003681766,0.0004268095,0.00005136042,0.00001745338],"category_scores_gemma":[0.0004108324,0.0001660339,0.00002599251,0.001210666,0.00002487705,0.005869155,0.0001026758,0.0001899083,0.0001522906],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001836562,"about_ca_system_score_gemma":0.00007353894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000242762,"about_ca_topic_score_gemma":0.000005558835,"domain_scores_codex":[0.9984632,0.00007246779,0.0004239843,0.0002268489,0.0004452781,0.0003682719],"domain_scores_gemma":[0.9992465,0.00008694574,0.0001565807,0.0002620716,0.0001664837,0.00008135429],"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.00005653021,0.00007213395,0.0008039279,0.000175955,0.0000157157,0.0000105337,0.03095834,0.191525,0.0287555,0.007262988,0.000360803,0.7400026],"study_design_scores_gemma":[0.001112719,0.00007291626,0.00544219,0.0002171352,0.000004394831,0.000009371488,0.0008554195,0.9697693,0.01073048,0.004607504,0.006578245,0.0006003458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2234151,0.000008673927,0.7740722,0.001628209,0.00007187523,0.0002252627,0.000001881286,0.0001411472,0.0004356602],"genre_scores_gemma":[0.8925728,9.513375e-7,0.1060408,0.001253161,0.00002592834,0.0000539493,0.00002614337,0.00001076818,0.00001548935],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7782443,"threshold_uncertainty_score":0.6770664,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01366666184045553,"score_gpt":0.2796372488493467,"score_spread":0.2659705870088912,"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."}}