{"id":"W2132648308","doi":"10.1109/spdp.1990.143503","title":"The maximum weight perfect matching problem for complete weighted graphs is in PC","year":2002,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Speedup; Combinatorics; Matching (statistics); Mathematics; Computation; Time complexity; Parallel algorithm; Minimum weight; Graph; Binary logarithm; Running time; Algorithm; Discrete mathematics; Computer science; Parallel computing","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.0007394486,0.0008095804,0.001125132,0.0008209634,0.001465871,0.002884897,0.001450105,0.001553611,0.01187732],"category_scores_gemma":[0.005084999,0.000416107,0.0009554829,0.002791796,0.001377584,0.006223863,0.00160424,0.001281306,0.00216255],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001521849,"about_ca_system_score_gemma":0.001573639,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003955028,"about_ca_topic_score_gemma":0.005366008,"domain_scores_codex":[0.9984545,0.000263488,0.00007439949,0.0006887646,0.0002681444,0.0002507324],"domain_scores_gemma":[0.9981235,0.000765989,0.0002697587,0.000459207,0.0002955889,0.000085977],"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.0005670783,0.0002169683,0.001604613,0.0008438615,0.000141981,0.0002967127,0.00033127,0.1139362,0.007081135,0.5237001,0.02596616,0.3253139],"study_design_scores_gemma":[0.00006821452,0.0001391048,0.0009011485,0.00005658975,0.00005331021,0.0003412747,0.000292813,0.2399045,0.009010958,0.7017608,0.04744601,0.00002529822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08318443,0.0008025282,0.853268,0.00281314,0.000267858,0.0003650142,0.00148826,0.001679613,0.05613118],"genre_scores_gemma":[0.523492,0.001371058,0.4252839,0.0006156732,0.0003385986,0.0005671511,0.004131939,0.0006480814,0.04355157],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01187732,"threshold_uncertainty_score":0.03973365,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03078141394729043,"score_gpt":0.2368455153117809,"score_spread":0.2060641013644904,"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."}}