{"id":"W2914264140","doi":"","title":"Tree decompositions and linear time algorithms","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Tree decomposition; K-ary tree; Mathematics; Combinatorics; Tree (set theory); Tree-depth; Algorithm; Treewidth; Disjoint sets; Modular decomposition; Time complexity; Discrete mathematics; Pathwidth; Computer science; Graph; Chordal graph; Tree structure; 1-planar graph; Line graph; Binary tree","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.001964803,0.001655537,0.001496466,0.001400869,0.001420929,0.003922726,0.002364405,0.001591171,0.01118558],"category_scores_gemma":[0.01202592,0.001095116,0.001865433,0.003735743,0.002265752,0.01038165,0.002823236,0.003890347,0.003648934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003477246,"about_ca_system_score_gemma":0.00222012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003255199,"about_ca_topic_score_gemma":0.00317753,"domain_scores_codex":[0.9959915,0.0009110417,0.000290966,0.001165686,0.0008838573,0.0007568891],"domain_scores_gemma":[0.9916245,0.005493273,0.0005334213,0.001370697,0.0007043082,0.0002738913],"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.0007403898,0.0004862474,0.001149042,0.001236035,0.000156588,0.0001680955,0.0006919443,0.1027808,0.007400054,0.5857039,0.03639926,0.2630876],"study_design_scores_gemma":[0.0001872382,0.00009586622,0.0001973304,0.00009883061,0.00006493695,0.0001451305,0.000125626,0.1668025,0.003523224,0.8099012,0.01882617,0.00003200074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03183201,0.003392692,0.9308553,0.002921934,0.0003255675,0.0002357874,0.0007341236,0.004752831,0.02494974],"genre_scores_gemma":[0.2269857,0.002800799,0.7493447,0.001438966,0.0004610697,0.0005939786,0.003524495,0.001347353,0.013503],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01118558,"threshold_uncertainty_score":0.0374195,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0206761545892767,"score_gpt":0.3101919391587306,"score_spread":0.2895157845694539,"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."}}