{"id":"W2137594903","doi":"10.1109/ipps.1999.760446","title":"Coarse grained parallel maximum matching in convex bipartite graphs","year":2003,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Bipartite graph; Combinatorics; Binary logarithm; Computation; Matching (statistics); Regular polygon; Mathematics; Graph; Computational complexity theory; Algorithm; Statistics","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006090656,0.0001770932,0.0002203589,0.0002692195,0.0001510823,0.0001608522,0.0006931952,0.00006097207,0.0001468937],"category_scores_gemma":[0.00004284057,0.0001641911,0.0001025925,0.0009275288,0.0000829803,0.0004501871,0.000143293,0.0002515566,0.00009581484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001972353,"about_ca_system_score_gemma":0.00004552215,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000144075,"about_ca_topic_score_gemma":0.0001854222,"domain_scores_codex":[0.9983786,0.0001718993,0.0003115577,0.0004327483,0.000251474,0.0004536699],"domain_scores_gemma":[0.9990813,0.0001377101,0.00005666891,0.000566931,0.00003577273,0.0001216541],"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.000002925043,0.00009272531,0.001288245,0.000007451252,0.000008202286,0.0000449288,0.0005933591,0.0001850005,0.0001050092,0.9915532,0.0004832407,0.005635744],"study_design_scores_gemma":[0.0008203461,0.00004921202,0.001897733,0.0000204493,0.000002263174,0.00003604155,0.0001364818,0.03069055,0.0003668574,0.9558719,0.009769323,0.0003388793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05333151,0.0001747215,0.9153598,0.001086383,0.000703302,0.0002695851,0.000001755434,0.0003806047,0.02869232],"genre_scores_gemma":[0.6838155,0.00003312955,0.3140729,0.00131721,0.00001484992,0.00002676747,0.000001958166,0.00001174199,0.0007059446],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6304839,"threshold_uncertainty_score":0.6695519,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02248653252835489,"score_gpt":0.2465879669221275,"score_spread":0.2241014343937726,"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."}}