{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003776029,0.003534252,0.002889106,0.002926875,0.003048483,0.00569095,0.01004575,0.005732541,0.0149802],"category_scores_gemma":[0.01804135,0.002656182,0.003251658,0.005874663,0.00227144,0.01597557,0.006683946,0.006238681,0.003337686],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004494608,"about_ca_system_score_gemma":0.004218818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005615263,"about_ca_topic_score_gemma":0.01108246,"domain_scores_codex":[0.9970326,0.0006969977,0.0001734873,0.0009330667,0.0005675518,0.0005962198],"domain_scores_gemma":[0.9854995,0.00977908,0.0007087439,0.002467652,0.0008499931,0.0006950534],"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.002549442,0.001585905,0.002495109,0.001841443,0.0003668764,0.0001669083,0.001204041,0.2890006,0.008547848,0.1128701,0.039551,0.5398207],"study_design_scores_gemma":[0.0009756737,0.0001828132,0.0006083068,0.0001273903,0.0002130396,0.0001545285,0.0004280042,0.7098264,0.004332874,0.2770074,0.006084078,0.00005954657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07377375,0.001847039,0.89833,0.002478272,0.0002833358,0.0009849309,0.001106121,0.005054749,0.01614181],"genre_scores_gemma":[0.1570956,0.0009085088,0.8297023,0.0004869245,0.0002676795,0.000978273,0.003040529,0.00118666,0.006333411],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0149802,"threshold_uncertainty_score":0.05011374,"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."}}