{"id":"W1998427290","doi":"10.1016/s0304-3975(03)00221-4","title":"Generating and characterizing the perfect elimination orderings of a chordal graph","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Chordal graph; Mathematics; Combinatorics; Amortized analysis; Oracle; Initialization; Clique; Treewidth; Discrete mathematics; Constant (computer programming); Graph; Algorithm; Computer science; Data structure; Pathwidth; Line graph","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.003158282,0.0001361889,0.0001557605,0.0001905024,0.0005848185,0.0002871151,0.001319812,0.00002895944,0.000009465223],"category_scores_gemma":[0.0003413826,0.00009250257,0.00004220873,0.001365523,0.003131661,0.0006626013,0.0005971374,0.0002065922,0.000003126364],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001975128,"about_ca_system_score_gemma":0.00007151286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001165991,"about_ca_topic_score_gemma":2.339463e-7,"domain_scores_codex":[0.9979566,0.0002678373,0.0002291716,0.0005085219,0.0005887573,0.0004491537],"domain_scores_gemma":[0.9985512,0.0004427241,0.00008139932,0.0005870515,0.0002073749,0.0001302757],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003137933,0.00001590591,0.00007931145,0.000007079125,0.000002165915,0.000001710297,0.0006155113,0.0000783773,0.03167571,0.9405975,8.488862e-7,0.0269227],"study_design_scores_gemma":[0.000285356,0.0003547017,0.002676144,0.0000415606,0.000004523879,0.000121026,0.0000381017,0.5465344,0.08532584,0.3642707,0.00008091178,0.0002667593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3463819,0.00004164234,0.6524708,0.0004105026,0.0001152254,0.0001200945,2.874492e-7,0.00003821782,0.0004213918],"genre_scores_gemma":[0.8767375,0.00001074689,0.1230104,0.0001997177,0.00002546968,0.000007596002,1.166141e-7,0.000005481361,0.000003009578],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5763269,"threshold_uncertainty_score":0.9995812,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01231511195538729,"score_gpt":0.2670450221646838,"score_spread":0.2547299102092965,"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."}}