{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005181745,0.001744427,0.004024874,0.003207927,0.003301405,0.0121569,0.006136582,0.004392683,0.01225103],"category_scores_gemma":[0.03726053,0.001766376,0.003678062,0.005962366,0.007936001,0.03417212,0.004836021,0.01296517,0.0007069231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.008603261,"about_ca_system_score_gemma":0.003143973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005638357,"about_ca_topic_score_gemma":0.00567391,"domain_scores_codex":[0.9937614,0.0021694,0.0002958984,0.001117286,0.001481826,0.001174247],"domain_scores_gemma":[0.9155617,0.07548557,0.00274061,0.00325881,0.001335275,0.001618057],"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.0005015825,0.0002592842,0.001899886,0.0003751868,0.0001316218,0.0002100306,0.0009234013,0.04880703,0.0009885556,0.9281124,0.003830359,0.01396059],"study_design_scores_gemma":[0.00005300789,0.00002845559,0.0004766602,0.00002736506,0.00005226756,0.00005727695,0.0001721171,0.05129047,0.0003892951,0.9466656,0.0007561978,0.0000313564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5915334,0.004622567,0.3033459,0.01649197,0.0003426591,0.000292884,0.002070631,0.0009757336,0.0803242],"genre_scores_gemma":[0.954481,0.001681289,0.02902131,0.0006455954,0.0004625304,0.0002768451,0.001569791,0.0003520492,0.0115096],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01225103,"threshold_uncertainty_score":0.06242132,"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."}}