{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008730702,0.001064324,0.002356849,0.001569495,0.002297076,0.002932981,0.003959285,0.003006223,0.00879702],"category_scores_gemma":[0.009219709,0.001234398,0.001440697,0.002919259,0.00114555,0.006364988,0.003093076,0.002020021,0.001703369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001550666,"about_ca_system_score_gemma":0.001609619,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001578675,"about_ca_topic_score_gemma":0.002923079,"domain_scores_codex":[0.9989287,0.0001895736,0.00008965224,0.0003859316,0.0001805332,0.0002255276],"domain_scores_gemma":[0.9946774,0.003152857,0.0005386531,0.0006436832,0.0003545374,0.0006328374],"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.005672481,0.003018073,0.02486523,0.005247461,0.0008288176,0.001587927,0.00277361,0.1327887,0.09942275,0.2546657,0.03287737,0.4362519],"study_design_scores_gemma":[0.0006211387,0.000903848,0.004641459,0.0002263694,0.0003744658,0.0009243553,0.002008105,0.352772,0.042199,0.584122,0.01111331,0.000093773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7124572,0.0006293666,0.259632,0.002111083,0.0001725557,0.0006343215,0.002483764,0.001450847,0.02042881],"genre_scores_gemma":[0.7364275,0.0004208157,0.2493555,0.0003960594,0.0001023141,0.0002523786,0.003258786,0.0003793536,0.0094073],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00879702,"threshold_uncertainty_score":0.02942896,"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."}}