{"id":"W119774723","doi":"10.1007/978-3-642-45043-3_8","title":"On the Parameterized Complexity of Computing Graph Bisections","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Parameterized complexity; Disjoint sets; Vertex (graph theory); Combinatorics; Time complexity; Partition (number theory); Mathematics; Constant (computer programming); Graph partition; Feedback vertex set; Bisection method; Connected component; Graph; Vertex cover; Discrete mathematics; Computer science; 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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.00156084,0.0005325076,0.0006504902,0.001181724,0.0005721167,0.0003843001,0.005457618,0.0002225823,0.00008451597],"category_scores_gemma":[0.0003400679,0.0003784507,0.0002599904,0.001479114,0.004112754,0.0003947235,0.001899561,0.001370457,0.00007525511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001625497,"about_ca_system_score_gemma":0.0002858665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004086308,"about_ca_topic_score_gemma":0.00003096193,"domain_scores_codex":[0.99562,0.0001736953,0.0006627592,0.001379552,0.001370329,0.0007936604],"domain_scores_gemma":[0.9936031,0.003000992,0.0003942564,0.002397513,0.0004338083,0.000170349],"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.00001055782,0.00004876114,0.00001025734,0.00002824578,0.00002308427,0.00001344512,0.0004858022,0.02912094,0.0005543201,0.8509095,0.00002528449,0.1187699],"study_design_scores_gemma":[0.0001613886,0.0002041673,0.0001188647,0.00022173,0.000003239839,0.0000213362,2.687061e-7,0.2618321,0.001761688,0.7353023,0.00005624066,0.0003167348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002120045,0.0000858315,0.9916602,0.0009742929,0.0008387094,0.0007844177,0.000008266194,0.0001414916,0.003386765],"genre_scores_gemma":[0.6641976,0.00002143,0.334373,0.001032035,0.0001371444,0.00001760509,0.000002864042,0.00004060793,0.0001777274],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6620775,"threshold_uncertainty_score":0.9999233,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05961691458284554,"score_gpt":0.2997903380168151,"score_spread":0.2401734234339696,"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."}}