{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004201663,0.0001509758,0.0003944148,0.0008061685,0.0003264452,0.0003066501,0.0008947406,0.00005250111,0.000001602534],"category_scores_gemma":[0.00001831257,0.0001097463,0.00009883197,0.00110629,0.0008233308,0.001013948,0.0001758542,0.0001560604,5.843125e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002810758,"about_ca_system_score_gemma":0.000123713,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001314186,"about_ca_topic_score_gemma":0.00001074202,"domain_scores_codex":[0.9975264,0.0001882764,0.0007703836,0.000291477,0.0008870639,0.0003363665],"domain_scores_gemma":[0.9981651,0.0004542235,0.0005692624,0.0002041597,0.0003808286,0.0002264465],"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.0001202909,0.0001394001,0.04031626,0.0002287452,0.0001150883,0.0001505544,0.003296199,0.0002491648,0.002061164,0.8971635,0.0002246119,0.05593508],"study_design_scores_gemma":[0.009016139,0.01070196,0.239212,0.002081497,0.0001141314,0.009424979,0.006723293,0.1108138,0.01159077,0.5973098,0.001363151,0.001648465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4389847,0.00089215,0.5592711,0.0001319554,0.0003529641,0.00008930844,6.481012e-7,0.00001396485,0.0002632479],"genre_scores_gemma":[0.9136555,0.00006718739,0.08612991,0.00006818698,0.0000626917,6.386109e-7,1.060673e-7,0.000003978072,0.00001182957],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4746708,"threshold_uncertainty_score":0.4475325,"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."}}