{"id":"W2035974993","doi":"10.1016/j.dam.2004.02.014","title":"Multi-terminal multipath flows: synthesis","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Windsor; University of New Brunswick","funders":"","keywords":"Mathematics; Combinatorics; Path (computing); Flow network; Disjoint sets; Shortest path problem; Undirected graph; Flow (mathematics); Enhanced Data Rates for GSM Evolution; Polynomial; Discrete mathematics; Maximum flow problem; Multi-commodity flow problem; Topology (electrical circuits); Graph; Computer science; Geometry; Telecommunications","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.0002607701,0.0005551219,0.0003610572,0.0005056691,0.0004069822,0.0008489584,0.0004509475,0.0007533194,0.00474443],"category_scores_gemma":[0.001205813,0.0003562075,0.0003576037,0.0005233196,0.0003805317,0.0007432239,0.000732585,0.0006932935,0.0009148277],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005749539,"about_ca_system_score_gemma":0.0004393267,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004411247,"about_ca_topic_score_gemma":0.0007286574,"domain_scores_codex":[0.9998717,0.00002728124,0.000005263249,0.000028448,0.0000484156,0.00001886441],"domain_scores_gemma":[0.9996318,0.0001514785,0.00003688939,0.00004636127,0.0001045659,0.00002888735],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002090639,0.00008303514,0.0007053539,0.0001824459,0.00003514746,0.000220494,0.0001858827,0.4135503,0.03264558,0.3775379,0.003707044,0.1709378],"study_design_scores_gemma":[0.00002115728,0.00006006232,0.0001444348,0.00003371049,0.00002253521,0.0001691742,0.00003697151,0.9204259,0.008363565,0.06406335,0.006639695,0.00001940803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0192285,0.0003358272,0.963252,0.0002053205,0.0001820849,0.000040963,0.00007049345,0.0003346817,0.01635015],"genre_scores_gemma":[0.6875846,0.001133725,0.2880237,0.0001662211,0.0002321665,0.0001226442,0.0001409039,0.0001528108,0.02244324],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00474443,"threshold_uncertainty_score":0.01587176,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02898757932986056,"score_gpt":0.2962409616097549,"score_spread":0.2672533822798943,"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."}}