{"id":"W2035362312","doi":"10.1016/s0304-3975(02)00725-9","title":"Algorithms for vertex-partitioning problems on graphs with fixed clique-width","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Mathematics; Combinatorics; Bounded function; Chordal graph; Independent set; Time complexity; Maximal independent set; Induced subgraph isomorphism problem; Discrete mathematics; Vertex (graph theory); Treewidth; Indifference graph; Clique-width; Pathwidth; 1-planar graph; Graph; 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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002276182,0.0002772806,0.0002674473,0.0003529005,0.0008776131,0.0005182422,0.002194044,0.00006037896,0.00002192137],"category_scores_gemma":[0.0002080252,0.0002062497,0.00009240677,0.002110927,0.003191442,0.0008481994,0.0002945849,0.0003077576,0.00004342912],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007949094,"about_ca_system_score_gemma":0.000219672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.256156e-7,"about_ca_topic_score_gemma":5.444702e-7,"domain_scores_codex":[0.9961923,0.0002255427,0.0002934909,0.001172725,0.001007628,0.001108367],"domain_scores_gemma":[0.9971414,0.0008398187,0.00008467236,0.001100694,0.0004139075,0.0004195505],"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.00003191383,0.00009930636,0.00007756023,0.00001146546,0.00000666106,0.000007441754,0.0001920122,0.001067857,0.0003045712,0.9814135,0.0000288721,0.01675885],"study_design_scores_gemma":[0.0006200015,0.00148489,0.0001655222,0.00007032504,0.00000351528,0.00004046243,0.000006827567,0.1853815,0.01127923,0.8003318,0.0003044645,0.0003114858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01076754,0.00001967347,0.9843062,0.0004478465,0.0003390274,0.0006672669,0.000002777649,0.0002603645,0.003189348],"genre_scores_gemma":[0.6151882,0.000002806915,0.3842214,0.0004500469,0.0000208074,0.00008116344,8.66098e-7,0.00001456768,0.00002013748],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6044207,"threshold_uncertainty_score":0.9995213,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02432058512118102,"score_gpt":0.2936323684329927,"score_spread":0.2693117833118117,"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."}}