{"id":"W2165352378","doi":"10.5555/1070432.1070490","title":"An O(VE) algorithm for ear decompositions of matching-covered graphs","year":2005,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Partition (number theory); Matching (statistics); Algorithm; Running time; Computer science; Mathematics; Blossom algorithm; Combinatorics; Discrete mathematics","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.0007518604,0.001083021,0.0009228126,0.001250595,0.0008764563,0.001446863,0.001856819,0.001174601,0.01139202],"category_scores_gemma":[0.003432053,0.0006018738,0.001464559,0.001465334,0.0008087854,0.003666106,0.003554527,0.001770427,0.003546948],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001001424,"about_ca_system_score_gemma":0.001392236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001534796,"about_ca_topic_score_gemma":0.002610005,"domain_scores_codex":[0.9987036,0.0002099789,0.00009293771,0.0003334629,0.000325641,0.0003342933],"domain_scores_gemma":[0.9982009,0.0007132238,0.0001523429,0.0006248937,0.0001767898,0.0001317788],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001038756,0.000565454,0.001972594,0.0006387559,0.0001226076,0.0002197507,0.0005937877,0.06714518,0.04359525,0.1004522,0.02199718,0.7616585],"study_design_scores_gemma":[0.0003841669,0.0004746368,0.001692255,0.00007264752,0.0001294712,0.0006741977,0.0003941091,0.6802628,0.03063534,0.2555168,0.02967066,0.00009284584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02523872,0.0001442004,0.9656743,0.0001985426,0.00003832339,0.0001968163,0.0002483577,0.003833368,0.004427358],"genre_scores_gemma":[0.1487677,0.0001659108,0.8439843,0.0001987897,0.00004819988,0.0003889813,0.001601888,0.0005318879,0.004312278],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01139202,"threshold_uncertainty_score":0.03811014,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01323844639757141,"score_gpt":0.3080781382825517,"score_spread":0.2948396918849802,"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."}}