{"id":"W2037455685","doi":"10.1016/j.orl.2010.03.003","title":"Revisiting a simple algorithm for the planar multiterminal cut problem","year":2010,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Simple (philosophy); Planar; Algorithm; SIMPLE algorithm; Mathematics; Maximum cut; Combinatorics; Terminal (telecommunication); Time complexity; Minimum cut; Computer science; Physics; Telecommunications; Graph","routes":{"ca_aff":true,"ca_fund":true,"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.001075981,0.001488852,0.001708483,0.001513924,0.001424065,0.002852428,0.004158315,0.002694484,0.01836985],"category_scores_gemma":[0.006576861,0.000821344,0.001887792,0.002925747,0.001289015,0.006017834,0.004864136,0.003665065,0.00534238],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001275495,"about_ca_system_score_gemma":0.002167884,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002046986,"about_ca_topic_score_gemma":0.003946704,"domain_scores_codex":[0.9982315,0.0003013363,0.0001248602,0.0004703967,0.0006362459,0.0002356887],"domain_scores_gemma":[0.9962462,0.001824871,0.0001543553,0.001090826,0.0005058051,0.0001779613],"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.0005934838,0.0005096423,0.0008833458,0.0007858889,0.0001232916,0.000413768,0.0003288295,0.04191592,0.01924781,0.1054857,0.02532104,0.8043913],"study_design_scores_gemma":[0.0006537474,0.0004385134,0.001221825,0.0001777816,0.0002160985,0.0009080508,0.0003318884,0.4978348,0.0134704,0.425041,0.05958699,0.0001189376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01776807,0.0004392242,0.9636018,0.0009647317,0.0004805325,0.000384922,0.0002749922,0.002389603,0.01369605],"genre_scores_gemma":[0.08392651,0.000388295,0.9041422,0.0004229007,0.000279764,0.0002952739,0.0008246269,0.0006858902,0.009034595],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01836985,"threshold_uncertainty_score":0.06145328,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05934213711343048,"score_gpt":0.3612582802058003,"score_spread":0.3019161430923698,"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."}}