{"id":"W1491529421","doi":"10.1007/3-540-36379-3_25","title":"New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k-Disjoint Cycles on Plane and Planar Graphs","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Combinatorics; Vertex cover; Planar graph; Disjoint sets; Treewidth; Mathematics; Vertex (graph theory); Feedback vertex set; Bounded function; Time complexity; Constant (computer programming); Binary logarithm; Kernelization; Cover (algebra); Discrete mathematics; Parameterized complexity; Graph; Pathwidth; Computer science; Mathematical analysis; Line graph","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006662608,0.0006593589,0.0006463063,0.0009428668,0.0003849442,0.0005795016,0.002072979,0.0003232376,0.00001496912],"category_scores_gemma":[0.0001061407,0.0005900309,0.0001058514,0.0004764533,0.0009429579,0.0005737882,0.0008382754,0.0008002855,0.00002427484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001282137,"about_ca_system_score_gemma":0.000193771,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001975245,"about_ca_topic_score_gemma":0.00001892765,"domain_scores_codex":[0.9956509,0.00004345391,0.0004230422,0.002025048,0.0009599702,0.0008975726],"domain_scores_gemma":[0.9965802,0.001504,0.0002017149,0.001145998,0.0001198134,0.0004482834],"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.00005715947,0.00002536481,0.00004029345,0.00008480083,0.00002893223,0.0001021649,0.0008544064,0.004260307,0.00009926355,0.1187667,0.0003640182,0.8753166],"study_design_scores_gemma":[0.0009965223,0.0008542388,0.0001837294,0.0004323044,0.00001005901,0.0002389373,6.31628e-7,0.2691397,0.0007812492,0.7235685,0.002912907,0.0008812134],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001296052,0.001510183,0.9946804,0.0008168647,0.0007276289,0.0007996599,0.000049199,0.0001294894,0.00115697],"genre_scores_gemma":[0.03123849,0.001179065,0.9622641,0.00231804,0.0004346287,0.00003256275,0.00002455347,0.0001213866,0.002387237],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8744354,"threshold_uncertainty_score":0.9996551,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03020348838626619,"score_gpt":0.276874548479269,"score_spread":0.2466710600930028,"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."}}