{"id":"W2726740999","doi":"10.1007/s00453-018-00538-5","title":"Maximum Induced Matching Algorithms via Vertex Ordering Characterizations","year":2019,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Bipartite graph; Vertex (graph theory); Line graph; Factor-critical graph; Discrete mathematics; Graph; Graph power","routes":{"ca_aff":true,"ca_fund":true,"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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003155868,0.0002290773,0.0002531966,0.0002732185,0.000219409,0.0002044456,0.001405148,0.000100713,0.000123658],"category_scores_gemma":[0.00003076254,0.0002329372,0.00008786598,0.0009538723,0.00003949088,0.001169886,0.0006487308,0.0003968798,0.001142267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007242376,"about_ca_system_score_gemma":0.00007696831,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002908093,"about_ca_topic_score_gemma":0.000001545396,"domain_scores_codex":[0.9978494,0.00009993518,0.0002895829,0.0006524171,0.0004696625,0.0006389997],"domain_scores_gemma":[0.9984081,0.0001589792,0.00009711926,0.001026405,0.0001293558,0.0001800565],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001180196,0.0001370643,0.0002587271,0.00003569526,0.00007531837,0.00005319464,0.001073001,0.0001584758,0.2060996,0.05057015,0.00003760374,0.7414894],"study_design_scores_gemma":[0.002082499,0.0004702783,0.007713689,0.0001432331,0.00001683411,0.0002473861,0.0001888245,0.5288591,0.0571311,0.3938615,0.007511718,0.001773787],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1038799,0.00002703435,0.8923567,0.0005890745,0.0008898015,0.0003806948,0.000005279274,0.0003818927,0.001489652],"genre_scores_gemma":[0.8424306,0.00001291057,0.1561232,0.0004199883,0.0001276151,0.00005500273,0.00002064306,0.00005873333,0.0007512841],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7397156,"threshold_uncertainty_score":0.9996355,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01578802293071043,"score_gpt":0.2686411270282091,"score_spread":0.2528531040974987,"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."}}