{"id":"W1971393213","doi":"10.1007/s00224-007-1345-z","title":"An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem","year":2007,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Parameterized complexity; Feedback vertex set; Combinatorics; Undirected graph; Mathematics; Vertex (graph theory); Algorithm; Bounded function; Running time; Exponential function; Vertex cover; Function (biology); Time complexity; Binary logarithm; Graph; Exponential time hypothesis; Set (abstract data type); Discrete mathematics; 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.01049746,0.0002610569,0.0004218546,0.0002349932,0.0004880325,0.0001739699,0.002488953,0.0001076496,0.000003424278],"category_scores_gemma":[0.0001181022,0.000193562,0.0001410716,0.0008785975,0.0002971901,0.0003098686,0.0002809905,0.0002669246,0.00001804065],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008161678,"about_ca_system_score_gemma":0.00009238631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003254181,"about_ca_topic_score_gemma":0.000003886331,"domain_scores_codex":[0.9966499,0.0007277011,0.0006609894,0.0005618755,0.0005985305,0.0008010585],"domain_scores_gemma":[0.9935334,0.004191169,0.000362862,0.001288206,0.0004511951,0.0001731111],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007016467,0.00009142618,0.00005864256,0.000121035,0.0001097842,0.000006341721,0.003065785,0.004583657,0.001725445,0.6826939,0.0002168137,0.307257],"study_design_scores_gemma":[0.001061015,0.0005066234,0.0009361132,0.0002630476,0.00002333496,0.00006573248,0.001515705,0.8656185,0.003055497,0.1247654,0.001741103,0.00044799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01608377,0.0004943199,0.9797782,0.0000589406,0.0009438896,0.001255197,0.00001330149,0.0003842512,0.000988084],"genre_scores_gemma":[0.9232524,0.000003759571,0.07604267,0.00005786703,0.0002396446,0.00001970741,0.000006961816,0.00004085786,0.0003361173],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9071686,"threshold_uncertainty_score":0.7893231,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02914474183978229,"score_gpt":0.3172132712211289,"score_spread":0.2880685293813466,"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."}}