{"id":"W2949906226","doi":"10.1016/j.dam.2014.12.006","title":"The cost of perfection for matchings in graphs","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Combinatorics; Mathematics; Bipartite graph; Matching (statistics); Strong perfect graph theorem; Triangulation; Minimum weight; Cubic graph; Upper and lower bounds; Polygon mesh; Chordal graph; Discrete mathematics; Line graph; 1-planar graph; Graph; Geometry","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.002195705,0.0006481764,0.001909771,0.002046064,0.00145777,0.004197005,0.002755321,0.003259076,0.01648656],"category_scores_gemma":[0.03626871,0.001048244,0.0008608519,0.002898655,0.002969937,0.01298649,0.002595203,0.002327732,0.0008078499],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002587197,"about_ca_system_score_gemma":0.001232406,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001644527,"about_ca_topic_score_gemma":0.001788333,"domain_scores_codex":[0.9979311,0.0006320184,0.0001276724,0.0002784119,0.0005591618,0.0004717024],"domain_scores_gemma":[0.9674897,0.02398656,0.002146792,0.002936553,0.001443445,0.001996893],"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.001487052,0.0001767924,0.004515217,0.000539274,0.0001271799,0.0003297176,0.0004545162,0.101322,0.003379597,0.820733,0.01343998,0.05349572],"study_design_scores_gemma":[0.0001017094,0.000130051,0.00139823,0.00006493861,0.0001029156,0.0002839612,0.0003047984,0.1711457,0.001565897,0.8222111,0.002649519,0.00004111174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8572538,0.001898482,0.08724758,0.009328031,0.0003619693,0.0001117692,0.001343994,0.000587375,0.04186701],"genre_scores_gemma":[0.9830692,0.0008109523,0.009258134,0.0002387292,0.0002116325,0.00005653167,0.0003380228,0.0001596062,0.005857222],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01648656,"threshold_uncertainty_score":0.05515301,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01527357090017878,"score_gpt":0.2862106641623685,"score_spread":0.2709370932621897,"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."}}