{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001820861,0.0001097945,0.000102098,0.0001875598,0.002064936,0.001069156,0.001427839,0.00004196345,0.00003538198],"category_scores_gemma":[0.0002051427,0.00008062826,0.00008252,0.0005940382,0.0002454011,0.0005162607,0.0002410493,0.0006904809,0.00003961026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002634355,"about_ca_system_score_gemma":0.0001025616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002752526,"about_ca_topic_score_gemma":0.0002998688,"domain_scores_codex":[0.9982466,0.000140135,0.0002097316,0.0003844455,0.0004950705,0.0005240096],"domain_scores_gemma":[0.9980727,0.0008116966,0.00001781754,0.0007128874,0.0002864242,0.00009843864],"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.000003587342,0.00006088499,0.00005483507,0.00002239695,0.00003657338,0.00002180078,0.001100516,0.001013659,0.02980924,0.07186814,0.01561714,0.8803912],"study_design_scores_gemma":[0.0002272626,0.00003605293,0.0001746999,0.00001286675,0.00000270347,0.00002964192,0.00006449834,0.919279,0.0009210671,0.001027689,0.07809916,0.000125374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006909056,0.00003233539,0.9552117,0.03648559,0.0002159914,0.0008503639,0.00003205719,0.00007522798,0.0001876548],"genre_scores_gemma":[0.03401531,0.00001423139,0.9620458,0.001841434,0.001028211,0.0006536099,0.00003014942,0.00001826009,0.0003529612],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9182653,"threshold_uncertainty_score":0.9999678,"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."}}