{"id":"W2109595435","doi":"10.1007/s00453-014-9928-y","title":"An $$O(n^4)$$ O ( n 4 ) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs","year":2014,"lang":"en","type":"article","venue":"Algorithmica","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Theory of computation; Grid; Partition (number theory); Combinatorics; Vertex connectivity; Bisection; Algorithm; Bisection method; Computer science; Graph theory; Mathematics; Graph; Discrete mathematics","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.0008220274,0.0001805772,0.0002793678,0.0001659049,0.0002278281,0.0001220859,0.001107071,0.00008278868,0.00001535079],"category_scores_gemma":[0.00001677023,0.0001311798,0.0001262606,0.0006580111,0.00005334234,0.0003195244,0.0001474106,0.000155614,0.000161126],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002838483,"about_ca_system_score_gemma":0.00002627054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000141987,"about_ca_topic_score_gemma":0.00001316032,"domain_scores_codex":[0.9982166,0.0002779115,0.0004027911,0.0004382192,0.0003360272,0.0003284228],"domain_scores_gemma":[0.998494,0.0001335043,0.0001610815,0.0008938507,0.0001644184,0.0001531136],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001089281,0.0001756263,0.00003389735,0.00001075863,0.00008892121,0.000004016283,0.001310966,0.003932944,0.002672905,0.01849349,0.02584928,0.9474163],"study_design_scores_gemma":[0.0001995935,0.0005328215,0.0004743028,0.00002627372,0.00000784159,0.00005123275,0.00001718554,0.9679341,0.002728745,0.003132018,0.02469797,0.0001979139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003069235,0.00002024205,0.9924487,0.0006884074,0.002531809,0.0002605523,0.000009447809,0.0001932493,0.0007783744],"genre_scores_gemma":[0.8413169,0.000007213379,0.153472,0.001917564,0.002534932,0.00006063825,0.00001703206,0.00004544325,0.0006282959],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9640012,"threshold_uncertainty_score":0.5349356,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006196863000501695,"score_gpt":0.2343314605366172,"score_spread":0.2281345975361155,"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."}}