{"id":"W1977889556","doi":"10.1016/s0012-365x(02)00803-8","title":"Finding a maximum induced matching in weakly chordal graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":93,"is_retracted":false,"has_abstract":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Chordal graph; Mathematics; Bipartite graph; Matching (statistics); Split graph; 3-dimensional matching; Interval graph; Vertex (graph theory); Indifference graph; Discrete mathematics; Factor-critical graph; Cardinality (data modeling); Pathwidth; Graph; 1-planar graph; Line graph; Graph power; Computer science","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.001150082,0.0002237535,0.0002906476,0.0004063052,0.000142453,0.0002018323,0.000992628,0.00008448972,0.00002730266],"category_scores_gemma":[0.0003042266,0.0002021481,0.0001011702,0.001153634,0.00005538844,0.00055629,0.0002408689,0.0004055154,0.00007327382],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006364538,"about_ca_system_score_gemma":0.00005979939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006511171,"about_ca_topic_score_gemma":0.00001236143,"domain_scores_codex":[0.9979033,0.0001666392,0.0004207888,0.000407165,0.0004817831,0.0006203513],"domain_scores_gemma":[0.9985908,0.0003053576,0.0001257763,0.0008053011,0.00004165432,0.0001310693],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002487709,0.0000658165,0.0002745147,0.00006148247,0.00001078921,0.0000382874,0.004024216,0.0000713308,0.005174673,0.9889847,0.00001023314,0.00128149],"study_design_scores_gemma":[0.0003153875,0.00004136996,0.000186885,0.0001008036,0.000002693326,0.00003477805,0.0007581557,0.004950831,0.004817592,0.9884361,0.00008511935,0.0002703003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4711958,0.00004902405,0.5146851,0.0001320274,0.0001412346,0.0003387482,0.000001990617,0.0001376614,0.01331845],"genre_scores_gemma":[0.8017177,0.00000739805,0.1980308,0.00005085143,0.000008141985,0.00003702053,0.000001070444,0.00002656265,0.0001204811],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3305219,"threshold_uncertainty_score":0.8243362,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03729535450122503,"score_gpt":0.314509867878203,"score_spread":0.277214513376978,"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."}}