{"id":"W2076853283","doi":"10.5555/365411.365510","title":"Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract)","year":2001,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto; Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Combinatorics; Chordal graph; Treewidth; Mathematics; 1-planar graph; Graph coloring; Indifference graph; Discrete mathematics; Clique-sum; Brooks' theorem; Pathwidth; Independent set; Edge coloring; Maximal independent set; Split graph; Bounded function; Graph; Line graph; Graph power","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":[],"consensus_categories":[],"category_scores_codex":[0.0004407038,0.0002059786,0.0001935767,0.0002249816,0.0003089588,0.000199357,0.0007058536,0.00007015977,0.00005374156],"category_scores_gemma":[0.0000484558,0.0001573235,0.0000984316,0.0005912911,0.000123548,0.0006533433,0.00008819672,0.000225137,0.00004376858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004806358,"about_ca_system_score_gemma":0.0000830687,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002201481,"about_ca_topic_score_gemma":0.00005580586,"domain_scores_codex":[0.9980193,0.00004568649,0.0002588249,0.0006102826,0.000401621,0.0006642427],"domain_scores_gemma":[0.9986382,0.0003099717,0.00009588895,0.0005972519,0.0001661597,0.000192519],"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.00156374,0.001389539,0.004554158,0.0001074045,0.0002395529,0.0001807503,0.0009719869,0.006433927,0.006112349,0.5628403,0.01183866,0.4037676],"study_design_scores_gemma":[0.01500481,0.01179001,0.04918477,0.0005050368,0.00004590846,0.000395683,0.0003625794,0.1244267,0.06111624,0.6519023,0.08175261,0.003513364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03309051,0.00003460651,0.9521062,0.00139885,0.0001832084,0.001143462,0.000007628093,0.0005227415,0.01151284],"genre_scores_gemma":[0.8027326,0.00002714756,0.1933363,0.0005593964,0.000108761,0.0004005303,0.00001354962,0.00003718908,0.002784489],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7696422,"threshold_uncertainty_score":0.6415465,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04164874076968241,"score_gpt":0.3105006895413826,"score_spread":0.2688519487717002,"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."}}