{"id":"W2966560041","doi":"10.1007/978-3-030-25027-0_17","title":"On the Tractability of Covering a Graph with 2-Clubs","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Parameterized complexity; Treewidth; Bipartite graph; Combinatorics; Planar graph; Vertex cover; Computer science; Graph; Discrete mathematics; Pathwidth; Bounded function; Mathematics; 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.001643146,0.0004282737,0.0004978405,0.0006401254,0.0001886529,0.0002049543,0.004690015,0.0001683826,0.00002870468],"category_scores_gemma":[0.0001918624,0.0002640345,0.0001407052,0.0009943008,0.001674455,0.0004479218,0.001012605,0.001137501,0.00002457446],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001595776,"about_ca_system_score_gemma":0.0005997252,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001010973,"about_ca_topic_score_gemma":0.00003727795,"domain_scores_codex":[0.9960838,0.0000790788,0.0003873676,0.001317946,0.001531641,0.000600189],"domain_scores_gemma":[0.993946,0.00279331,0.0002921192,0.002568227,0.0002950123,0.0001053805],"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.00008045721,0.00006832835,0.0001482643,0.00008628115,0.0000268716,0.00004130355,0.0008362214,0.1114173,0.000399163,0.7314016,0.000006390488,0.1554878],"study_design_scores_gemma":[0.000307478,0.0007976207,0.0003716595,0.0005719151,0.000005055678,0.0000391896,3.576267e-7,0.09493389,0.004831522,0.8974185,0.000189238,0.0005336046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002122035,0.0001079505,0.9911219,0.0005409157,0.0003851755,0.0006696192,0.000005648335,0.00006218615,0.004984582],"genre_scores_gemma":[0.9116016,0.00001861192,0.08726344,0.000751992,0.00006941352,0.00001227684,9.897711e-7,0.00003707372,0.0002445847],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9094796,"threshold_uncertainty_score":0.9999812,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01847064711104523,"score_gpt":0.2587484430426983,"score_spread":0.240277795931653,"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."}}