{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001275244,0.002114398,0.002264987,0.00248006,0.001884124,0.004106609,0.00616879,0.002723794,0.0123058],"category_scores_gemma":[0.008683979,0.00140875,0.002164672,0.004413644,0.001722407,0.01028617,0.005492926,0.003848054,0.002594209],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004085941,"about_ca_system_score_gemma":0.002350256,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005476731,"about_ca_topic_score_gemma":0.009684941,"domain_scores_codex":[0.9981765,0.0002589744,0.0001607006,0.0004543296,0.0006884756,0.0002609577],"domain_scores_gemma":[0.9949164,0.002492796,0.0003611472,0.00132991,0.0006604601,0.0002392665],"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.0008067379,0.0004629535,0.0009566845,0.0006239584,0.0001316784,0.0001386394,0.0005472667,0.1061203,0.00816286,0.1919762,0.0352479,0.6548249],"study_design_scores_gemma":[0.0002871689,0.0001152379,0.0004700358,0.00009055145,0.0001102287,0.0002984574,0.0002193429,0.6495845,0.006180004,0.3274213,0.01514666,0.00007650165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03258952,0.001088776,0.9468972,0.0008545137,0.0002436082,0.0003470521,0.0005464719,0.00365773,0.01377519],"genre_scores_gemma":[0.0967692,0.0006705239,0.890606,0.0002506341,0.0002147516,0.0005786082,0.001348093,0.0006311963,0.008930885],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0123058,"threshold_uncertainty_score":0.04116696,"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."}}