{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001249853,0.002086299,0.002226448,0.001338477,0.001681886,0.002987751,0.003660266,0.003370347,0.02428181],"category_scores_gemma":[0.008026271,0.0007462287,0.001803744,0.002232946,0.001101559,0.005462582,0.002799505,0.00333856,0.00546517],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003031914,"about_ca_system_score_gemma":0.003377664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006444945,"about_ca_topic_score_gemma":0.009393606,"domain_scores_codex":[0.9977512,0.0003905673,0.000106005,0.0007564813,0.0006009813,0.0003947318],"domain_scores_gemma":[0.995402,0.002923643,0.0002318828,0.0008582156,0.0003340772,0.0002502535],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001785937,0.0009778644,0.001240583,0.001020441,0.0002323014,0.0003249203,0.000286747,0.1339455,0.01166467,0.04502906,0.07401678,0.7294751],"study_design_scores_gemma":[0.001191485,0.0002845545,0.001039607,0.0001230643,0.0002004806,0.000508047,0.0002415227,0.8070819,0.00563415,0.1687423,0.01487401,0.00007891982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04740681,0.001397523,0.8925188,0.004169851,0.0008341281,0.0008919765,0.002239704,0.01304086,0.03750029],"genre_scores_gemma":[0.2272948,0.0004057469,0.7500528,0.001091476,0.0003381636,0.00103231,0.003343868,0.001238046,0.01520267],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02428181,"threshold_uncertainty_score":0.0812307,"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."}}