{"id":"W3002002006","doi":"10.1007/978-3-030-39881-1_27","title":"Parameterized Algorithms for the Happy Set Problem","year":2020,"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":"University of Alberta","funders":"","keywords":"Parameterized complexity; Combinatorics; Undirected graph; Vertex (graph theory); Mathematics; Graph; Vertex cover; Discrete mathematics; Clique; Set (abstract data type); Integer (computer science); Computer science; Algorithm","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.002096775,0.002133174,0.002422225,0.001466021,0.002741418,0.00626212,0.007496043,0.003014527,0.03904413],"category_scores_gemma":[0.009954204,0.001618987,0.003323071,0.004525982,0.002098167,0.01413596,0.006276873,0.008598934,0.008026792],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003812925,"about_ca_system_score_gemma":0.003097966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002196702,"about_ca_topic_score_gemma":0.003156809,"domain_scores_codex":[0.9973757,0.000648114,0.0001467666,0.0007354372,0.0006913611,0.000402674],"domain_scores_gemma":[0.9943704,0.003348805,0.0002470525,0.00144391,0.0003162511,0.0002735659],"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.0004226196,0.0005494732,0.0003989812,0.0005939873,0.00009868757,0.00006899194,0.0003600548,0.03971188,0.002570591,0.6081404,0.0725471,0.2745372],"study_design_scores_gemma":[0.0001899492,0.00005718363,0.0002290674,0.00007355209,0.00005482408,0.0001250307,0.0001574182,0.1182679,0.001373631,0.8590096,0.02042831,0.00003355819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01742235,0.001054931,0.921515,0.002079652,0.0003332758,0.0003990654,0.001615477,0.002586787,0.05299344],"genre_scores_gemma":[0.1344421,0.00178344,0.8185266,0.0007755216,0.0005252644,0.001338313,0.006515464,0.00248561,0.03360776],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03904413,"threshold_uncertainty_score":0.1306156,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05112185459821832,"score_gpt":0.3106082458598953,"score_spread":0.2594863912616769,"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."}}