{"id":"W2111157038","doi":"10.1109/icpr.2002.1047427","title":"A new algorithm for inexact graph matching","year":2003,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Subgraph isomorphism problem; Matching (statistics); Factor-critical graph; Blossom algorithm; Algorithm; Graph isomorphism; 3-dimensional matching; Computer science; Graph; Distance-hereditary graph; Optimal matching; Mathematics; Line graph; Theoretical computer science; Voltage 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.001406707,0.001465732,0.001597789,0.004152659,0.002018849,0.002576595,0.003695745,0.002718692,0.009264743],"category_scores_gemma":[0.007637127,0.0008713233,0.001391286,0.004482189,0.001314751,0.007059539,0.004259456,0.00294858,0.004777197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001126756,"about_ca_system_score_gemma":0.002482488,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003595387,"about_ca_topic_score_gemma":0.003140036,"domain_scores_codex":[0.9970511,0.0004286106,0.000250353,0.0008663842,0.00120548,0.0001981205],"domain_scores_gemma":[0.9961915,0.0009455508,0.0003212483,0.001151343,0.001195804,0.0001946167],"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.0002889718,0.0001877929,0.0007402068,0.0002285458,0.0001162658,0.0002365184,0.00018412,0.07003593,0.01129651,0.06966282,0.01905026,0.8279721],"study_design_scores_gemma":[0.0001198038,0.0001594886,0.0004085517,0.00004874329,0.00006314339,0.0009282539,0.0001344088,0.8140966,0.01569497,0.1196538,0.04861249,0.00007988758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001453592,0.00009962723,0.995732,0.0001140237,0.00008775009,0.0000741747,0.00007769231,0.001300565,0.001060527],"genre_scores_gemma":[0.01976218,0.0001526604,0.9759179,0.0001167321,0.00005881152,0.0001703916,0.0005065624,0.0002986169,0.003016168],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009264743,"threshold_uncertainty_score":0.03099364,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01168720470694194,"score_gpt":0.2364212628795303,"score_spread":0.2247340581725883,"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."}}