{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002183079,0.001560162,0.002739175,0.002685923,0.003193357,0.005929658,0.003834683,0.003699935,0.02157125],"category_scores_gemma":[0.02049301,0.001745744,0.003667048,0.00508437,0.004505712,0.01227054,0.004751988,0.005783637,0.001918241],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003620598,"about_ca_system_score_gemma":0.001872496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005401136,"about_ca_topic_score_gemma":0.004962024,"domain_scores_codex":[0.9970025,0.001056438,0.0001416613,0.0006826555,0.000619832,0.0004969118],"domain_scores_gemma":[0.9657966,0.02858452,0.001486874,0.00226271,0.0007540436,0.001115218],"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.0006367827,0.0002280952,0.002072659,0.0007575807,0.0001578382,0.0004311945,0.0009900109,0.1419603,0.003494916,0.8073699,0.01303203,0.02886872],"study_design_scores_gemma":[0.00005603728,0.00006420039,0.0005469292,0.00008644249,0.00005649338,0.0002622058,0.0001196414,0.1158611,0.000763318,0.8786426,0.003514345,0.00002682546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4369351,0.002470249,0.3511215,0.007262934,0.0003154088,0.0003773004,0.003863659,0.001661405,0.1959925],"genre_scores_gemma":[0.874922,0.002969649,0.07828598,0.0009892734,0.000674612,0.0007835553,0.004236131,0.001300086,0.03583875],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02157125,"threshold_uncertainty_score":0.07216305,"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."}}