{"id":"W2109716789","doi":"10.1016/s0166-218x(00)00221-3","title":"On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic","year":2001,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":208,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Bounded function; Treewidth; Combinatorics; Monadic predicate calculus; Enumeration; Discrete mathematics; Clique-width; Time complexity; Graph; Second-order logic; Computational complexity theory; Upper and lower bounds; Clique; Pathwidth; Algorithm; Line graph; Computer science; Theoretical computer science","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.0007536593,0.0001918531,0.0002855537,0.0001794148,0.0001332819,0.00007517198,0.0008642633,0.00006897307,0.0001092352],"category_scores_gemma":[0.000123548,0.0001306636,0.00006601887,0.001015261,0.0002791944,0.000161042,0.0001903571,0.000272438,0.00004573382],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003654881,"about_ca_system_score_gemma":0.00003202098,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008848126,"about_ca_topic_score_gemma":0.00005254976,"domain_scores_codex":[0.9983678,0.00007167897,0.000429539,0.0003275162,0.0004080559,0.0003954188],"domain_scores_gemma":[0.9980745,0.0007260535,0.0001920722,0.000881231,0.00007068807,0.00005547852],"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.00001280762,0.0001305451,0.00003514142,0.00007365401,0.000011821,0.000002700089,0.00101263,0.001137554,0.002227927,0.9948533,0.00005413908,0.0004477336],"study_design_scores_gemma":[0.0002889911,0.00006499411,0.0001741756,0.00003384375,0.000003225878,0.000005019549,0.0001614704,0.03349373,0.002628517,0.9629403,0.00005751065,0.0001482352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2155292,0.00004201274,0.7654068,0.0004729044,0.00002976454,0.001112801,0.00000639825,0.00006936217,0.01733077],"genre_scores_gemma":[0.8919675,0.00001620413,0.1074314,0.0002151309,0.000006177801,0.0002114968,0.000006975518,0.0000176035,0.000127533],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6764383,"threshold_uncertainty_score":0.5328306,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06192859394975599,"score_gpt":0.2857134996855245,"score_spread":0.2237849057357685,"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."}}