{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000520899,0.0003287616,0.0003767803,0.001240256,0.0011255,0.002294989,0.0009537102,0.0004795424,0.002521421],"category_scores_gemma":[0.004281732,0.0003885409,0.0004917366,0.001178541,0.001127118,0.002076789,0.0007962495,0.0009002974,0.0003799858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008729309,"about_ca_system_score_gemma":0.001087064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002161238,"about_ca_topic_score_gemma":0.004173501,"domain_scores_codex":[0.9992982,0.0001094044,0.00004719526,0.000170555,0.0002082291,0.0001664156],"domain_scores_gemma":[0.9959415,0.002055641,0.0005736189,0.0006424368,0.0004513371,0.0003355294],"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.0005117067,0.0002679772,0.01434356,0.0003036169,0.00004605299,0.0004976381,0.002186978,0.02053408,0.03117135,0.846962,0.004270142,0.07890497],"study_design_scores_gemma":[0.00007255489,0.0001331139,0.003869799,0.00003406042,0.00004538811,0.0004666444,0.0008767358,0.05084571,0.01725674,0.9186532,0.007708212,0.00003768096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8525941,0.000115769,0.1283427,0.0003235605,0.00003426279,0.0001239457,0.001114585,0.0003183923,0.01703268],"genre_scores_gemma":[0.9499236,0.00009710379,0.04264413,0.00006236645,0.00003441359,0.00004033214,0.001817839,0.00009304448,0.005287155],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002521421,"threshold_uncertainty_score":0.008435011,"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."}}