{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002232291,0.002047895,0.003004599,0.002040826,0.002877455,0.006519879,0.005614182,0.003148719,0.03270825],"category_scores_gemma":[0.01677998,0.001788838,0.002837477,0.004952717,0.002314768,0.0182565,0.005216811,0.004346763,0.005021857],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004846838,"about_ca_system_score_gemma":0.004317794,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002743425,"about_ca_topic_score_gemma":0.008983204,"domain_scores_codex":[0.9959182,0.0007871222,0.0002725033,0.001220592,0.001007761,0.0007938981],"domain_scores_gemma":[0.9843876,0.01038897,0.001039643,0.002315101,0.0007172308,0.00115144],"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.00690388,0.003438392,0.006492111,0.004570376,0.0008362355,0.0005310248,0.002120264,0.1049162,0.03227206,0.2917629,0.09260239,0.4535541],"study_design_scores_gemma":[0.001612253,0.0004253087,0.001534763,0.000151793,0.0005179144,0.00048182,0.0007611502,0.2124496,0.01170404,0.7556226,0.01465007,0.00008868172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3632899,0.002711138,0.532885,0.008906701,0.000654566,0.002162858,0.01078753,0.01147411,0.06712819],"genre_scores_gemma":[0.5700659,0.001196134,0.3847926,0.001344474,0.0004779648,0.001099041,0.01341225,0.002159122,0.02545244],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03270825,"threshold_uncertainty_score":0.10942,"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."}}