{"id":"W3028209208","doi":"10.1007/s10107-020-01513-1","title":"Maximum edge-disjoint paths in planar graphs with congestion 2","year":2020,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia; Cegep Edouard Montpetit","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Disjoint sets; Combinatorics; Constant (computer programming); Discrete mathematics; Omega; Planar graph; Planar; Enhanced Data Rates for GSM Evolution; Path (computing); Graph; Computer science","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.001526472,0.001120009,0.001537253,0.002499713,0.001913385,0.003253128,0.002600484,0.001863822,0.008134029],"category_scores_gemma":[0.01690543,0.001528747,0.0009984128,0.003766822,0.002059834,0.007042693,0.003481396,0.002304452,0.0004853675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002065629,"about_ca_system_score_gemma":0.00125233,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002035306,"about_ca_topic_score_gemma":0.0028376,"domain_scores_codex":[0.9987459,0.0004017858,0.00006799075,0.0002902321,0.0002424018,0.0002516418],"domain_scores_gemma":[0.9898518,0.007875545,0.000945789,0.0003080676,0.0004312818,0.0005874786],"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.0005645648,0.0001937485,0.002131001,0.0008647959,0.0001227936,0.0003074237,0.0008531234,0.1577332,0.003918182,0.7860691,0.006531767,0.04071029],"study_design_scores_gemma":[0.0000946916,0.00007528981,0.0007053239,0.00007396558,0.00008130226,0.0002250999,0.0002762169,0.1751927,0.001754311,0.8182647,0.003228825,0.00002748874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4470394,0.001338299,0.5156125,0.002748861,0.0001061139,0.0003533593,0.001347892,0.0005993128,0.03085427],"genre_scores_gemma":[0.815589,0.001476132,0.166991,0.0003401166,0.0001474313,0.0004446071,0.0009062254,0.0002427991,0.01386262],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008134029,"threshold_uncertainty_score":0.02721107,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03352946441831534,"score_gpt":0.2769085679406327,"score_spread":0.2433791035223174,"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."}}