{"id":"W231720905","doi":"10.1016/j.knosys.2015.05.012","title":"Approximating the maximum common subgraph isomorphism problem with a weighted graph","year":2015,"lang":"en","type":"article","venue":"Knowledge-Based Systems","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Induced subgraph isomorphism problem; Subgraph isomorphism problem; Graph isomorphism; Mathematics; Combinatorics; Graph homomorphism; Distance-hereditary graph; Isomorphism (crystallography); Discrete mathematics; Induced subgraph; Graph factorization; Factor-critical graph; Graph; Cograph; Line graph; Pathwidth; 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.001610038,0.001008414,0.002288859,0.002745193,0.0009895528,0.002345163,0.003422132,0.002578572,0.004540571],"category_scores_gemma":[0.01584294,0.0007832104,0.001357134,0.004723713,0.001303276,0.008163678,0.002836281,0.002064673,0.0006068175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00191151,"about_ca_system_score_gemma":0.001672108,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007494642,"about_ca_topic_score_gemma":0.008075411,"domain_scores_codex":[0.997885,0.0007177388,0.00009721694,0.0006624905,0.0004144283,0.0002230417],"domain_scores_gemma":[0.9927204,0.005206762,0.0003779688,0.0009904162,0.000487879,0.0002165705],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004796512,0.0004886434,0.003097473,0.0005256518,0.0002335071,0.000222681,0.0002898376,0.7133284,0.002663404,0.07255467,0.007714264,0.1984019],"study_design_scores_gemma":[0.00002923548,0.00003637866,0.0002853481,0.00001573833,0.00003241604,0.00005160799,0.00009449981,0.877618,0.0006683432,0.1203687,0.0007920383,0.000007645529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.101531,0.0005368168,0.8921758,0.0009177168,0.00006582067,0.0001084802,0.0005515893,0.0006030097,0.003509815],"genre_scores_gemma":[0.6292464,0.0005677725,0.3638023,0.0002112651,0.0001008004,0.000186863,0.002005322,0.0002410649,0.00363821],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007494642,"threshold_uncertainty_score":0.01518971,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02209990361606246,"score_gpt":0.229079896000099,"score_spread":0.2069799923840366,"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."}}