{"id":"W3161061639","doi":"","title":"Price of Connectivity for the vertex cover problem and the dominating set problem: Conjectures and investigation of critical graphs","year":2017,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Vertex cover; Combinatorics; Mathematics; Dominating set; Bipartite graph; Vertex (graph theory); Bounded function; Discrete mathematics; Maximal independent set; Feedback vertex set; Edge cover; Connected component; Chordal graph; Graph; 1-planar 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.004334775,0.001527159,0.00220022,0.00344943,0.002314627,0.006540018,0.00385828,0.005202565,0.009800437],"category_scores_gemma":[0.05375391,0.001153538,0.002257768,0.00409074,0.006852641,0.02089004,0.003365749,0.007063584,0.0006781187],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005359996,"about_ca_system_score_gemma":0.001113821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002086253,"about_ca_topic_score_gemma":0.001015275,"domain_scores_codex":[0.9972603,0.0007165853,0.0001037289,0.0007891562,0.0007618654,0.0003681875],"domain_scores_gemma":[0.9421751,0.04721763,0.003497072,0.002702233,0.00226609,0.002141897],"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.0003263939,0.0001397701,0.003569226,0.000425799,0.00008700936,0.0002855783,0.0004301321,0.0262196,0.001703845,0.940141,0.009923396,0.01674835],"study_design_scores_gemma":[0.00007405927,0.0001002959,0.001668349,0.0001378135,0.000057963,0.0004383527,0.0002393569,0.09219503,0.0008361613,0.8977512,0.006444228,0.00005721503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5480493,0.01988758,0.2845476,0.04194807,0.001344501,0.0003400036,0.00157038,0.0005895566,0.1017231],"genre_scores_gemma":[0.9427369,0.007362189,0.03585785,0.002548706,0.002470185,0.0003165452,0.0009179246,0.0004000858,0.007389622],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009800437,"threshold_uncertainty_score":0.03888965,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01896815255539841,"score_gpt":0.2868417533792701,"score_spread":0.2678736008238717,"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."}}