{"id":"W2099914933","doi":"10.1145/1240233.1240237","title":"Improved algorithms for weakly chordal graphs","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Chordal graph; Combinatorics; Interval graph; Mathematics; Treewidth; Clique problem; Split graph; Discrete mathematics; Computational complexity theory; Clique; Time complexity; Algorithm; Graph; Pathwidth; Line graph; 1-planar 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001268729,0.0003381666,0.000294716,0.000657415,0.0006193945,0.0001524968,0.002179413,0.0001800234,0.00004113089],"category_scores_gemma":[0.00009688683,0.0003294255,0.0003450929,0.001408564,0.0001868839,0.0007472446,0.00003803599,0.0005482471,0.00005552073],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001196986,"about_ca_system_score_gemma":0.0000920824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003201042,"about_ca_topic_score_gemma":0.00003005486,"domain_scores_codex":[0.9970211,0.00006703119,0.0004499611,0.0008842708,0.0005303677,0.001047308],"domain_scores_gemma":[0.9967189,0.0008247365,0.00009607802,0.001710452,0.0002799458,0.0003698748],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000100859,0.0002892962,0.000004034212,0.00001420726,0.00007694551,0.00001456677,0.0002302823,0.0001678723,0.004775932,0.01114635,0.00005594875,0.9831237],"study_design_scores_gemma":[0.006594119,0.003751558,0.001322299,0.00007829151,0.00008598708,0.0002141811,0.0004960368,0.2211392,0.2809263,0.4547879,0.02827965,0.002324446],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007032085,0.00007264172,0.995382,0.000995967,0.001114952,0.000853183,0.00005305281,0.0005044266,0.0003205892],"genre_scores_gemma":[0.07497326,0.00005917235,0.9228054,0.0004245968,0.0001408995,0.0002620081,0.00000769652,0.0000629968,0.001263959],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9807993,"threshold_uncertainty_score":0.9999158,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03253514641846965,"score_gpt":0.3255083337152803,"score_spread":0.2929731872968106,"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."}}