{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001076357,0.001218708,0.000886664,0.0008369592,0.001399805,0.00229059,0.00223838,0.001439707,0.006012543],"category_scores_gemma":[0.004177895,0.0006281979,0.001232981,0.002442979,0.001353083,0.004289984,0.002038722,0.00176707,0.001441296],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002718968,"about_ca_system_score_gemma":0.001795839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009307893,"about_ca_topic_score_gemma":0.0109754,"domain_scores_codex":[0.9991202,0.0002380558,0.00003603324,0.000227645,0.0001354186,0.0002426622],"domain_scores_gemma":[0.9977258,0.001500086,0.0001869644,0.0003431103,0.0001414214,0.0001026475],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009575795,0.0006534474,0.001722449,0.001000351,0.0001481883,0.0002290814,0.0007730526,0.47812,0.01313576,0.2274212,0.03202237,0.2438165],"study_design_scores_gemma":[0.0003491147,0.00009960287,0.0006108512,0.0000459384,0.00005299786,0.0001612184,0.0001577221,0.6978999,0.004050035,0.2903526,0.006192793,0.0000272223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09517541,0.001363846,0.8854513,0.001882792,0.000124229,0.0003309514,0.0008864042,0.002049223,0.01273587],"genre_scores_gemma":[0.3418513,0.001132616,0.6457777,0.0003505714,0.000188659,0.0004390169,0.002879997,0.000469546,0.006910498],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009307893,"threshold_uncertainty_score":0.02011389,"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."}}