{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002826111,0.002527996,0.002876669,0.002366739,0.002473515,0.01021173,0.006923442,0.002786822,0.02383776],"category_scores_gemma":[0.02855636,0.001780622,0.00362071,0.007215279,0.004458094,0.02888586,0.006545945,0.009962055,0.00346633],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007546562,"about_ca_system_score_gemma":0.004054563,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004909615,"about_ca_topic_score_gemma":0.006309546,"domain_scores_codex":[0.9939487,0.001461237,0.0004149523,0.00139049,0.00198817,0.0007963559],"domain_scores_gemma":[0.9684224,0.02369571,0.001042557,0.004783383,0.001236188,0.0008197791],"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.001034182,0.0004738806,0.002998641,0.001263501,0.0002457707,0.0002173029,0.0009395452,0.1155016,0.006268498,0.6706893,0.02869735,0.1716704],"study_design_scores_gemma":[0.00008080385,0.00005234711,0.000483761,0.00007239971,0.00007609896,0.000117248,0.0001391881,0.108506,0.001411944,0.8844734,0.004551077,0.00003592741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1807528,0.005889865,0.709668,0.009740794,0.001022615,0.0004402277,0.003408008,0.003733683,0.08534392],"genre_scores_gemma":[0.6313844,0.00535896,0.3151039,0.001621006,0.001989741,0.0009668115,0.007393982,0.003412403,0.03276882],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02383776,"threshold_uncertainty_score":0.07974529,"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."}}