{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002656705,0.001495469,0.0016916,0.003155348,0.002090512,0.005807918,0.00519842,0.003004577,0.01349332],"category_scores_gemma":[0.02257935,0.001477507,0.001766127,0.005830622,0.002020614,0.01609207,0.006673775,0.005891655,0.002625477],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00294833,"about_ca_system_score_gemma":0.002094328,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007579022,"about_ca_topic_score_gemma":0.001813909,"domain_scores_codex":[0.9947299,0.001599956,0.0003104615,0.001403267,0.001302767,0.0006537401],"domain_scores_gemma":[0.9799691,0.01250716,0.001057185,0.004222306,0.001402408,0.0008417161],"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.0013788,0.001196397,0.002785425,0.0006459802,0.0001433419,0.000150517,0.0006482817,0.06629988,0.007543306,0.6334519,0.02111349,0.2646427],"study_design_scores_gemma":[0.0001314373,0.0001222798,0.0004214554,0.00007575689,0.00008703431,0.000132641,0.0001617879,0.2643414,0.005195877,0.7224709,0.006825248,0.00003419473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0797433,0.0006928079,0.8851888,0.001968349,0.0001772798,0.000328124,0.001002099,0.003115562,0.02778362],"genre_scores_gemma":[0.5972154,0.0006728926,0.3791791,0.001026422,0.0004196442,0.0006145898,0.003169126,0.001707692,0.01599513],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01349332,"threshold_uncertainty_score":0.04513967,"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."}}