{"id":"W1586356312","doi":"10.1007/978-3-319-12691-3_22","title":"Algorithms for Cut Problems on Trees","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina; University of Alberta","funders":"","keywords":"Parameterized complexity; Combinatorics; Running time; Time complexity; Tree (set theory); Mathematics; Constant (computer programming); Polynomial; Computer science; Discrete mathematics; Algorithm","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.0008515749,0.001783098,0.001240534,0.001826964,0.001049152,0.003847327,0.003201614,0.001832378,0.0209594],"category_scores_gemma":[0.006053254,0.001115462,0.001652641,0.004627693,0.001391316,0.007658681,0.002709469,0.006437096,0.005828566],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001781974,"about_ca_system_score_gemma":0.001146283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001419124,"about_ca_topic_score_gemma":0.002122771,"domain_scores_codex":[0.9988709,0.0001995345,0.00006832904,0.000240925,0.0004941405,0.0001260499],"domain_scores_gemma":[0.9976206,0.001561124,0.00007476993,0.0003831447,0.0002677823,0.00009250039],"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.0001077401,0.0001603232,0.0002723722,0.0009063993,0.00006270913,0.0000590151,0.0002723631,0.01955665,0.002335816,0.5146697,0.0610159,0.400581],"study_design_scores_gemma":[0.00007311883,0.00002590554,0.0001855384,0.0001412985,0.00003976073,0.0001616905,0.00008486035,0.0556257,0.001434159,0.8977687,0.04444208,0.00001715611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009382899,0.006011954,0.912936,0.001783478,0.0006599979,0.0002296451,0.000769139,0.001918615,0.06630833],"genre_scores_gemma":[0.07601245,0.006915437,0.8694923,0.0007061566,0.0007673216,0.0005988572,0.003192195,0.001326546,0.04098878],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0209594,"threshold_uncertainty_score":0.07011622,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03428784771039901,"score_gpt":0.2979919124767282,"score_spread":0.2637040647663292,"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."}}