{"id":"W2224651063","doi":"10.22215/etd/2007-06323","title":"On improving FPT K-VERTEX COVER with applications to some combinatorial problems","year":2007,"lang":"en","type":"dissertation","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Cover (algebra); Vertex (graph theory); Vertex cover; Combinatorics; Mathematics; Computer science; Engineering; Time complexity; Mechanical engineering","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.002654655,0.001607691,0.001822469,0.002833446,0.001652866,0.002808293,0.002614658,0.002101795,0.01217696],"category_scores_gemma":[0.01741581,0.0004038883,0.001658636,0.005314335,0.001543633,0.004895644,0.002845122,0.003112717,0.002045449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003048686,"about_ca_system_score_gemma":0.002121564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005798619,"about_ca_topic_score_gemma":0.009326353,"domain_scores_codex":[0.9974641,0.0006596255,0.0001119453,0.000418745,0.0008460286,0.0004996692],"domain_scores_gemma":[0.9917455,0.005794595,0.0002146585,0.001355331,0.0006531598,0.0002367033],"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.0007224843,0.0006376941,0.002173183,0.0006405835,0.000111151,0.0003056855,0.0003086909,0.2815889,0.0065,0.08469097,0.04245072,0.5798699],"study_design_scores_gemma":[0.0001040612,0.0002165021,0.0008844874,0.00008029916,0.00008983282,0.0003217129,0.0001190339,0.8837628,0.00371598,0.0960869,0.01459803,0.00002027355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1656566,0.008300076,0.6732973,0.008836287,0.001717107,0.0008171306,0.00110972,0.005684706,0.1345811],"genre_scores_gemma":[0.4292667,0.003101826,0.5398272,0.001613824,0.001425538,0.0004655296,0.002032965,0.001115538,0.021151],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01217696,"threshold_uncertainty_score":0.04073602,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00863670814053174,"score_gpt":0.2656693011958386,"score_spread":0.2570325930553068,"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."}}