{"id":"W2594925297","doi":"10.1016/j.cor.2017.02.019","title":"A strongly polynomial Contraction-Expansion algorithm for network flow problems","year":2017,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"HEC Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Contraction (grammar); Algorithm; Flow network; Computer science; Maximum flow problem; Flow (mathematics); Polynomial; Mathematics; Mathematical optimization; Geometry; Mathematical analysis","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.001949438,0.001407227,0.001388599,0.001047558,0.001154356,0.00169016,0.00341675,0.001878014,0.01178871],"category_scores_gemma":[0.008139594,0.0007066999,0.001217893,0.001858072,0.00140839,0.00385417,0.003650289,0.004946331,0.002349585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001733727,"about_ca_system_score_gemma":0.003691332,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003953665,"about_ca_topic_score_gemma":0.004749302,"domain_scores_codex":[0.9987697,0.0003766596,0.00005277148,0.0003166174,0.0002892412,0.0001950084],"domain_scores_gemma":[0.9964364,0.002210419,0.0001122719,0.0005497218,0.0004584603,0.0002327533],"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.001286492,0.001000844,0.001087207,0.0004959412,0.00007346513,0.0001642733,0.0005067533,0.1747478,0.01157521,0.1837204,0.04084069,0.584501],"study_design_scores_gemma":[0.0003497892,0.0001638698,0.0003404513,0.00004983358,0.00004638418,0.0001163592,0.0001028117,0.804039,0.00359392,0.1825275,0.0086408,0.00002925882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02809531,0.0003200529,0.9503937,0.001325021,0.0002092051,0.0003075838,0.0002945366,0.001603415,0.01745116],"genre_scores_gemma":[0.1754034,0.0003062671,0.8075104,0.0005840376,0.0002015893,0.000585661,0.001049501,0.0006940164,0.01366515],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01178871,"threshold_uncertainty_score":0.03943723,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09211569102058015,"score_gpt":0.3732049175096355,"score_spread":0.2810892264890554,"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."}}