{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003131605,0.0001052457,0.0001050893,0.0000912531,0.0001207401,0.0001232088,0.0004263217,0.00003487955,0.00005091199],"category_scores_gemma":[0.00001450292,0.00008694613,0.000103618,0.0003284371,0.00001092995,0.0003638193,0.00003779216,0.00006226175,0.00002865958],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006036872,"about_ca_system_score_gemma":0.00004623975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000158792,"about_ca_topic_score_gemma":0.000001656253,"domain_scores_codex":[0.9992222,0.00003716564,0.0001254279,0.0002564619,0.000106038,0.0002527738],"domain_scores_gemma":[0.9994254,0.00009588184,0.00003154181,0.000300241,0.00002802314,0.0001189684],"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":[4.342988e-7,0.00001431713,0.000004037485,0.000001798474,0.000008601927,0.000002059379,0.0001527865,0.00002194311,0.0000690483,0.7563819,0.000935506,0.2424075],"study_design_scores_gemma":[0.0004138894,0.00006140968,0.00002058882,0.000005405418,0.000003308768,0.00002418092,0.00003976617,0.01086336,0.003078446,0.975619,0.009698173,0.0001724741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001681529,0.00006214632,0.9921353,0.0001626512,0.0004239905,0.0001372378,0.000001082112,0.0001824093,0.006726988],"genre_scores_gemma":[0.009303198,0.000003098765,0.9873518,0.0005140032,0.00004886837,0.00001115133,7.780205e-7,0.000007476613,0.002759614],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2422351,"threshold_uncertainty_score":0.354556,"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."}}