{"id":"W7053286013","doi":"","title":"Tree decompositions and linear time algorithms","year":2012,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Laser Design and Applications","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"National Institute of Informatics; McGill University","keywords":"Tree decomposition; K-ary tree; Disjoint sets; Tree (set theory); Modular decomposition; Tree-depth; Time complexity; Interval tree; Gomory–Hu tree","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001880697,0.001676862,0.001424838,0.001756095,0.00139007,0.00475166,0.00245578,0.001733733,0.01474232],"category_scores_gemma":[0.01100542,0.001149154,0.001841644,0.004317393,0.002150415,0.010499,0.00301257,0.004023422,0.004487908],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00414485,"about_ca_system_score_gemma":0.002376615,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003826621,"about_ca_topic_score_gemma":0.003486274,"domain_scores_codex":[0.9957181,0.000910603,0.0003027834,0.001209235,0.00103818,0.0008211893],"domain_scores_gemma":[0.9932752,0.004300278,0.0004456743,0.001089473,0.0006447652,0.0002446447],"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.0005806413,0.0003864559,0.0009071901,0.001145481,0.0001303938,0.0001359949,0.000666444,0.08852882,0.005180693,0.5833794,0.04294297,0.2760155],"study_design_scores_gemma":[0.0001830414,0.00009003993,0.0001990105,0.0001139889,0.00005784795,0.0001508378,0.0001424736,0.1883032,0.002709958,0.7822546,0.02576109,0.00003379497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02336708,0.004392456,0.927862,0.003373138,0.0003782141,0.0002618135,0.0009876214,0.006248382,0.03312921],"genre_scores_gemma":[0.2181529,0.003573116,0.7499942,0.00175006,0.0004962473,0.0007267171,0.004404237,0.001627274,0.0192753],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01474232,"threshold_uncertainty_score":0.04931796,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01179901987956402,"score_gpt":0.2258311636702186,"score_spread":0.2140321437906546,"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."}}