{"id":"W2132147722","doi":"10.1007/s10107-015-0944-8","title":"Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs","year":2015,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Bounded function; Upper and lower bounds; Parametric statistics; Rank (graph theory); Maximum cut; Polynomial; Time complexity; Pareto principle; Graph; Discrete mathematics; Mathematical optimization; Mathematical analysis","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.006751909,0.004225361,0.003349228,0.003578819,0.002068306,0.009656841,0.006714181,0.003756973,0.01370672],"category_scores_gemma":[0.05055624,0.002180122,0.003176179,0.005436358,0.005746232,0.01924443,0.006312752,0.0139316,0.001487719],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.008559079,"about_ca_system_score_gemma":0.003647437,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004025978,"about_ca_topic_score_gemma":0.008018481,"domain_scores_codex":[0.9950885,0.001574569,0.0001552088,0.0009219485,0.001264118,0.0009956839],"domain_scores_gemma":[0.927836,0.06134946,0.003456943,0.003116652,0.002321615,0.001919303],"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.0009745139,0.0004818258,0.002620798,0.001196607,0.0002095237,0.0001872843,0.0008736019,0.4052972,0.003309101,0.5074505,0.01422757,0.06317148],"study_design_scores_gemma":[0.0000650428,0.00009261406,0.0007372839,0.0001416254,0.00009008786,0.00008567933,0.0001968585,0.4136779,0.001011206,0.5814664,0.002397157,0.00003820159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08366396,0.005614827,0.8543035,0.007990994,0.0003750284,0.0002148038,0.001168213,0.0006530586,0.04601557],"genre_scores_gemma":[0.7328678,0.005762887,0.2315742,0.001872282,0.001311921,0.0008047349,0.001836502,0.001284588,0.02268508],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01370672,"threshold_uncertainty_score":0.06210077,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04022054374351302,"score_gpt":0.2952712546187547,"score_spread":0.2550507108752417,"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."}}