{"id":"W2170132163","doi":"10.1145/1103963.1103969","title":"An <i>O</i> ( <i>VE</i> ) algorithm for ear decompositions of matching-covered graphs","year":2005,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Matching (statistics); Algorithm; Partition (number theory); Combinatorics; Blossom algorithm; Factor-critical graph; Graph; Discrete mathematics; Line graph; Voltage graph","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.0009756339,0.001234022,0.001075252,0.001468773,0.00114548,0.002043186,0.002828212,0.001672668,0.01229469],"category_scores_gemma":[0.00376859,0.0007945914,0.002136219,0.001879287,0.001160356,0.004981476,0.00447135,0.002275915,0.004445422],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001404762,"about_ca_system_score_gemma":0.001798456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001681692,"about_ca_topic_score_gemma":0.00284745,"domain_scores_codex":[0.9983542,0.0002457789,0.0001267799,0.0004833085,0.0004061788,0.0003838516],"domain_scores_gemma":[0.9977819,0.0007355817,0.0002290629,0.0008507236,0.0002308114,0.0001719884],"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.001060141,0.0007443678,0.002251294,0.0007030301,0.0001738719,0.0002185351,0.0005411991,0.05018351,0.04439043,0.09553753,0.03237029,0.7718258],"study_design_scores_gemma":[0.000649434,0.0006943549,0.002296098,0.000115891,0.0002178594,0.001032549,0.0004006272,0.6351231,0.05167815,0.26291,0.04470917,0.00017278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01599891,0.0001640533,0.9735126,0.0003078544,0.00005897313,0.0002268316,0.0002564834,0.004227048,0.00524723],"genre_scores_gemma":[0.09662952,0.0001760137,0.8960834,0.0002785596,0.00006467541,0.000421315,0.001432789,0.0006338188,0.004279969],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01229469,"threshold_uncertainty_score":0.04112983,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01833050890336663,"score_gpt":0.3081120926644815,"score_spread":0.2897815837611148,"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."}}