{"id":"W2144688537","doi":"10.1016/s0012-365x(03)00236-x","title":"Channel assignment on graphs of bounded treewidth","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Treewidth; Mathematics; Partial k-tree; Bipartite graph; Discrete mathematics; Vertex (graph theory); Bounded function; Chordal graph; Clique-sum; 1-planar graph; Pathwidth; 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":[],"consensus_categories":[],"category_scores_codex":[0.0006032194,0.0001673188,0.0002531015,0.0001764552,0.00009194575,0.00005714787,0.0007260739,0.00004763827,0.00002539547],"category_scores_gemma":[0.0001926542,0.0001327961,0.000117966,0.0004968834,0.0001231118,0.0001670897,0.0001054504,0.0001331695,0.00004029734],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000326469,"about_ca_system_score_gemma":0.00003726636,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.649635e-7,"about_ca_topic_score_gemma":7.721252e-7,"domain_scores_codex":[0.9983726,0.0001096702,0.0003159457,0.0002759077,0.0005807406,0.0003451828],"domain_scores_gemma":[0.9984918,0.0002536477,0.0001560645,0.0009269477,0.00006305226,0.0001084882],"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.00000389648,0.0001474508,0.00001270582,0.00005204553,0.00002209031,0.000004907325,0.000918124,0.0001252788,0.0004885268,0.9977182,0.00006887428,0.0004379404],"study_design_scores_gemma":[0.0003129111,0.000211823,0.00002519456,0.00006155538,0.000005355016,0.000006674076,0.0002164962,0.007510996,0.02627025,0.9649377,0.0002756806,0.0001653868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01306177,0.00006095169,0.9562262,0.0001323982,0.0001185699,0.0003319843,0.000006320167,0.00008614798,0.02997564],"genre_scores_gemma":[0.9109836,0.00001624541,0.0882533,0.00006639713,0.000006677384,0.00003341754,0.000001492462,0.00002157948,0.0006173603],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8979217,"threshold_uncertainty_score":0.5415267,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03251552382568142,"score_gpt":0.2964065856925989,"score_spread":0.2638910618669175,"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."}}