{"id":"W2108310473","doi":"10.1023/a:1009859026994","title":"Graph Algorithms with Small Communication Costs","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Theory of computation; Focus (optics); Shortest path problem; Parallel algorithm; Theoretical computer science; Cost efficiency; Graph theory; Communication complexity; Mathematical optimization; Graph; Algorithm; Parallel computing; Mathematics","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.001908419,0.00222587,0.00199187,0.00199796,0.001863859,0.003180382,0.003987671,0.003022133,0.02292301],"category_scores_gemma":[0.02130386,0.001101963,0.001445763,0.00328168,0.001826496,0.008650342,0.003779634,0.0041747,0.005460101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00179096,"about_ca_system_score_gemma":0.00279023,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001287802,"about_ca_topic_score_gemma":0.00281831,"domain_scores_codex":[0.9974586,0.001015464,0.0001204788,0.0004284304,0.000583867,0.0003931802],"domain_scores_gemma":[0.9814733,0.01174491,0.0007591968,0.004512768,0.0008466901,0.0006630464],"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.002835216,0.001116501,0.001589215,0.001054169,0.0002457071,0.0002358372,0.0003131836,0.3966897,0.01325512,0.1513352,0.06290533,0.368425],"study_design_scores_gemma":[0.0007032086,0.0002622719,0.000583945,0.00007058342,0.0001447939,0.0001587064,0.0001314156,0.6220697,0.006439344,0.3601324,0.009265549,0.00003801467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1060483,0.002607345,0.8203936,0.007905305,0.001068008,0.0006668533,0.001154766,0.006235822,0.05392008],"genre_scores_gemma":[0.4810749,0.001397196,0.4842832,0.001388658,0.000883339,0.001183419,0.001438209,0.002412762,0.02593843],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02292301,"threshold_uncertainty_score":0.07668513,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009833638694845234,"score_gpt":0.2207930325220085,"score_spread":0.2109593938271632,"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."}}