{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001491531,0.001607617,0.001681812,0.001777982,0.001297774,0.002283741,0.005601231,0.001603018,0.009624567],"category_scores_gemma":[0.009295243,0.001030724,0.001740169,0.00238579,0.001306918,0.007796089,0.00582508,0.00313906,0.002811411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00238906,"about_ca_system_score_gemma":0.002209264,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004010259,"about_ca_topic_score_gemma":0.005700727,"domain_scores_codex":[0.9961124,0.0006364387,0.0002861823,0.0009800724,0.001334724,0.0006502772],"domain_scores_gemma":[0.9937314,0.002217069,0.0003902121,0.002548504,0.0008712628,0.0002414142],"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.0007724832,0.0006310503,0.001759358,0.0007029701,0.0001233563,0.0002717799,0.0004748056,0.1575901,0.0245265,0.1782455,0.02228723,0.6126149],"study_design_scores_gemma":[0.0002189132,0.0001265358,0.0005537231,0.00004495298,0.00006781543,0.0002335852,0.0001267566,0.6967981,0.01354079,0.2744612,0.01376789,0.0000597845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01402654,0.0002250801,0.9776293,0.0003275255,0.00007475596,0.0001771008,0.000234827,0.003335618,0.003969203],"genre_scores_gemma":[0.1380846,0.0002500961,0.8551428,0.0002058204,0.000117773,0.0003364212,0.001320413,0.000666366,0.003875757],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009624567,"threshold_uncertainty_score":0.03219742,"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."}}