{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006734774,0.0002126504,0.0006139626,0.0003063846,0.0002089088,0.00005732314,0.001626501,0.00006337881,0.000006870931],"category_scores_gemma":[0.0006644717,0.0001610403,0.0001487249,0.0009959762,0.0007758318,0.0001098649,0.000362263,0.0003242563,0.00001072473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003475711,"about_ca_system_score_gemma":0.00003433497,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003341072,"about_ca_topic_score_gemma":0.000002656253,"domain_scores_codex":[0.9948723,0.002894902,0.0008223386,0.0004152422,0.0005161223,0.0004790729],"domain_scores_gemma":[0.9916744,0.006372892,0.0005439658,0.0011621,0.000172709,0.00007399282],"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.00004347043,0.00008999281,0.0004711226,0.00008569577,0.00002414955,0.00000115696,0.001232768,0.01863897,0.002368505,0.9752806,0.00001582072,0.001747708],"study_design_scores_gemma":[0.0006330578,0.0002096143,0.005121348,0.00053602,0.000003947829,0.00000814514,0.0002210962,0.3396102,0.002095231,0.6513672,0.00001575846,0.000178299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5471019,0.00003179609,0.4505613,0.0000886136,0.0002100683,0.0003256712,0.000003195659,0.00007843596,0.001599057],"genre_scores_gemma":[0.9948139,0.00000137427,0.005041554,0.00007262536,0.00002945548,0.000007389266,0.000001918646,0.00001534657,0.00001647049],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.447712,"threshold_uncertainty_score":0.6567035,"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."}}