{"id":"W2962852933","doi":"10.5539/cis.v12n3p81","title":"Modeling the Parallelization of the Edmonds-Karp Algorithm and Application","year":2019,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Computer science; Maximum flow problem; Algorithm; Computation; Minimum cut; Maximum cut; Graph; Theoretical computer science; Combinatorics; Mathematics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005541991,0.0006463779,0.0004976302,0.0005440214,0.0005206882,0.001261782,0.001577479,0.0009674388,0.004406608],"category_scores_gemma":[0.003525262,0.0003946006,0.0006047396,0.00122792,0.0008679003,0.001856767,0.0007108153,0.001192292,0.001012396],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001367257,"about_ca_system_score_gemma":0.00152974,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008224375,"about_ca_topic_score_gemma":0.004950374,"domain_scores_codex":[0.9994237,0.0001344421,0.00002479626,0.0001439678,0.0001912564,0.00008183745],"domain_scores_gemma":[0.9993414,0.0002718445,0.0000568446,0.0001213499,0.0001810899,0.00002742159],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004536441,0.00004998968,0.0007151093,0.000131237,0.00002068075,0.0001024015,0.0001020644,0.7421031,0.00226261,0.216988,0.003342318,0.03413715],"study_design_scores_gemma":[0.000009174921,0.000008379497,0.00008742243,0.000008997795,0.000004409465,0.00003021281,0.0000111707,0.95105,0.001024225,0.03988867,0.007871475,0.000005835489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02226875,0.0006359062,0.9495243,0.0005638192,0.000139988,0.0000981588,0.0001219502,0.0005244018,0.02612275],"genre_scores_gemma":[0.4014771,0.001751723,0.5767583,0.0002285076,0.0001371352,0.0003835889,0.0003076972,0.0004395676,0.01851642],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008224375,"threshold_uncertainty_score":0.01635301,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008319934742299261,"score_gpt":0.2191753482244641,"score_spread":0.2108554134821648,"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."}}