{"id":"W2032278054","doi":"10.1007/s00224-014-9557-5","title":"On the Parameterized Complexity of Computing Balanced Partitions in Graphs","year":2014,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Parameterized complexity; Combinatorics; Vertex (graph theory); Partition (number theory); Vertex cover; Mathematics; Neighbourhood (mathematics); Time complexity; Feedback vertex set; Graph partition; Constant (computer programming); Graph; Bisection; Computer science; Geometry","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.004428702,0.002153755,0.002921885,0.002055075,0.002536935,0.01010016,0.005693849,0.003402224,0.0198059],"category_scores_gemma":[0.05203515,0.001522506,0.002632414,0.005740599,0.004352526,0.02930056,0.005832007,0.006050079,0.001759176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007420255,"about_ca_system_score_gemma":0.005480756,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007207477,"about_ca_topic_score_gemma":0.01193105,"domain_scores_codex":[0.9926969,0.002545571,0.0004754896,0.001438843,0.001707323,0.001135881],"domain_scores_gemma":[0.9278957,0.05943539,0.002281926,0.006872399,0.001884431,0.001630037],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003451172,0.0008964982,0.0104246,0.001448335,0.0004220276,0.0003330633,0.001549625,0.4706387,0.009396576,0.3376935,0.02786715,0.1358788],"study_design_scores_gemma":[0.000217467,0.0001106113,0.001217989,0.0000698701,0.0001234797,0.0001177977,0.000331782,0.485323,0.001820855,0.508618,0.002006975,0.0000422309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5070193,0.003546358,0.4347922,0.01338099,0.000571973,0.0004178734,0.004222377,0.003037485,0.0330115],"genre_scores_gemma":[0.8444405,0.001755368,0.1346842,0.00118502,0.0007749504,0.0004693944,0.005368936,0.001531028,0.009790576],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0198059,"threshold_uncertainty_score":0.06625736,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05734722256749251,"score_gpt":0.3022804971018644,"score_spread":0.2449332745343719,"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."}}