{"id":"W1763401657","doi":"10.1007/3-540-45471-3_21","title":"A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Matroid; Graphic matroid; Matroid partitioning; Combinatorics; Mathematics; Time complexity; Basis (linear algebra); Cycle basis; Discrete mathematics; Matrix (chemical analysis); Matrix multiplication; Oriented matroid; 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.0004537674,0.001253093,0.001394489,0.001191513,0.0009467514,0.002178406,0.002420742,0.00136465,0.01074436],"category_scores_gemma":[0.002162976,0.0008397028,0.001336601,0.002238339,0.0007647692,0.002909421,0.001909015,0.001860878,0.002354175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001622765,"about_ca_system_score_gemma":0.001643531,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003134202,"about_ca_topic_score_gemma":0.005804029,"domain_scores_codex":[0.9995126,0.00006437772,0.00002918319,0.0001753284,0.0001251141,0.00009343921],"domain_scores_gemma":[0.9990078,0.0004633757,0.00007685662,0.0002341748,0.0001233971,0.00009452606],"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.001036072,0.0006227284,0.001756583,0.001136516,0.0001792911,0.0002149532,0.0005206405,0.07329129,0.0378353,0.08221808,0.04278649,0.7584022],"study_design_scores_gemma":[0.0008702305,0.0005193505,0.001655021,0.0001123149,0.000217688,0.0005957286,0.0006173581,0.5806639,0.02019843,0.3725349,0.0219323,0.00008280316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.161253,0.0008227907,0.7992956,0.001491141,0.0001712082,0.0005899672,0.002003263,0.005624856,0.02874828],"genre_scores_gemma":[0.2334004,0.0003415787,0.7512355,0.000189857,0.00006696469,0.0003390353,0.003893854,0.000691034,0.009841841],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01074436,"threshold_uncertainty_score":0.03594345,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01206932577443784,"score_gpt":0.2476371203445412,"score_spread":0.2355677945701034,"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."}}