{"id":"W2000945011","doi":"10.1016/j.jcss.2007.01.003","title":"Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth","year":2007,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"Treewidth; Bounded function; Combinatorics; Mathematics; Induced subgraph isomorphism problem; Isomorphism (crystallography); Discrete mathematics; Subgraph isomorphism problem; Graph; Pathwidth; Line graph; Chemistry","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.001335811,0.0004564684,0.001181131,0.001694127,0.001614921,0.002414922,0.002212061,0.001585045,0.005310069],"category_scores_gemma":[0.01574091,0.0006529253,0.0005592134,0.003435941,0.003285151,0.009846379,0.002440482,0.002344968,0.0003532892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001857047,"about_ca_system_score_gemma":0.001080532,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00248501,"about_ca_topic_score_gemma":0.00246138,"domain_scores_codex":[0.9988437,0.0003120771,0.00004819821,0.000280448,0.0002514121,0.0002642121],"domain_scores_gemma":[0.9771149,0.01407658,0.003409563,0.002917389,0.0009419282,0.001539545],"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.0006897144,0.0002775218,0.01234823,0.0002374676,0.00007862953,0.0008025469,0.001444742,0.06647235,0.00591846,0.8732298,0.005127444,0.03337298],"study_design_scores_gemma":[0.00004993596,0.00004196372,0.001764941,0.00001679093,0.00002517774,0.0005754491,0.0003617423,0.04176764,0.0009247343,0.9532379,0.001214246,0.00001952058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8342232,0.001212479,0.1483294,0.002896582,0.00005921538,0.00004701961,0.0006002478,0.000657881,0.01197405],"genre_scores_gemma":[0.9866835,0.0003095042,0.01006356,0.0001970684,0.00006576627,0.00004679905,0.0004021387,0.00008537599,0.002146215],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005310069,"threshold_uncertainty_score":0.01776391,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02049196485234504,"score_gpt":0.2900205360545985,"score_spread":0.2695285712022535,"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."}}