{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001163096,0.001855714,0.001142547,0.001762646,0.001071009,0.002630866,0.003370751,0.001558069,0.01865747],"category_scores_gemma":[0.005906946,0.0008263888,0.001543571,0.002334579,0.001130788,0.004686291,0.003568536,0.003504942,0.003670637],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002472679,"about_ca_system_score_gemma":0.003573975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005629838,"about_ca_topic_score_gemma":0.01438827,"domain_scores_codex":[0.9989592,0.0001825816,0.00005535136,0.0003184953,0.0003096138,0.0001747712],"domain_scores_gemma":[0.9971462,0.001363987,0.0002052139,0.0006896698,0.0003533917,0.0002415669],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001685441,0.000708638,0.003443753,0.0009838375,0.0003636119,0.000150317,0.0003755583,0.1641459,0.02400206,0.07380313,0.05960011,0.6707377],"study_design_scores_gemma":[0.0006075791,0.0002155971,0.001227961,0.00007427142,0.0001397805,0.0001462818,0.0001879683,0.8652295,0.01019295,0.1087987,0.01310911,0.00007020901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03896225,0.000488289,0.9385949,0.00120499,0.0003547514,0.0002717987,0.0008097027,0.006747813,0.01256552],"genre_scores_gemma":[0.1565871,0.0002634967,0.8319793,0.0004237281,0.0001236417,0.0005018843,0.001825956,0.0008816962,0.007413225],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01865747,"threshold_uncertainty_score":0.06241548,"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."}}