{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001346338,0.0006974922,0.001319206,0.00141865,0.002572245,0.003584968,0.002177884,0.001374568,0.008293873],"category_scores_gemma":[0.009387059,0.0007963587,0.0005881944,0.002336088,0.002141372,0.008046966,0.003044057,0.002219354,0.0009253395],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001899,"about_ca_system_score_gemma":0.001759959,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00206038,"about_ca_topic_score_gemma":0.002538793,"domain_scores_codex":[0.998489,0.0004246889,0.00005297071,0.0002735425,0.0002542987,0.0005055158],"domain_scores_gemma":[0.9854702,0.00970597,0.0009202008,0.001505666,0.001015742,0.001382294],"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.0005137933,0.0001463182,0.0006059236,0.0001857433,0.00002182273,0.0001520842,0.0004555247,0.03779268,0.004612125,0.923559,0.007103702,0.02485135],"study_design_scores_gemma":[0.00006706019,0.00003533557,0.0001948204,0.00002934376,0.00002891438,0.00008021447,0.0001620091,0.09848028,0.002006662,0.8961161,0.00277402,0.00002517171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3563684,0.0006706502,0.6089427,0.002463011,0.000228114,0.000137396,0.0006824983,0.001535065,0.02897218],"genre_scores_gemma":[0.8994015,0.0007487142,0.08361334,0.0004989988,0.0002306317,0.0002308983,0.0005579179,0.0005702222,0.01414785],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008293873,"threshold_uncertainty_score":0.02774572,"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."}}