{"id":"W1999576733","doi":"10.1007/s00453-007-9045-2","title":"Maximum Induced Matchings for Chordal Graphs in Linear Time","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Chordal graph; Combinatorics; Interval graph; Mathematics; Indifference graph; Split graph; Maximal independent set; Treewidth; Discrete mathematics; Pathwidth; Bipartite graph; Time complexity; Cograph; Line graph; Graph; 1-planar 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001384163,0.0001637388,0.000203583,0.0004349059,0.0001072833,0.00005226429,0.001085411,0.0001047718,0.00001368268],"category_scores_gemma":[0.000109441,0.0001623041,0.00009482504,0.0009591724,0.00006078025,0.0004319873,0.0002556198,0.0003087651,0.0001247326],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005818768,"about_ca_system_score_gemma":0.00005169296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002436645,"about_ca_topic_score_gemma":0.000009117981,"domain_scores_codex":[0.9981343,0.00004884093,0.0002960596,0.0004886855,0.0003181635,0.0007139097],"domain_scores_gemma":[0.9987393,0.0004153989,0.00006246373,0.0005304934,0.00009811141,0.0001542214],"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.000184815,0.0003272443,0.0003485221,0.0000363652,0.00004627964,0.00015915,0.00131693,0.00004165045,0.05047625,0.1489381,0.0006395783,0.7974851],"study_design_scores_gemma":[0.001897512,0.0004255852,0.002211385,0.00003606268,0.000004172838,0.00004462155,0.00005162132,0.06121323,0.04902981,0.8779799,0.006509786,0.0005962882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1225253,0.00004126309,0.8748266,0.0006450799,0.0003002139,0.0005473312,0.000006328886,0.0001915467,0.0009163785],"genre_scores_gemma":[0.3129738,0.000006112411,0.6853805,0.0005472939,0.000195574,0.0000749817,0.00001157894,0.00005217653,0.0007580553],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7968888,"threshold_uncertainty_score":0.6618568,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01783560561319089,"score_gpt":0.3055982628954908,"score_spread":0.2877626572822999,"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."}}