{"id":"W792477341","doi":"10.1007/978-3-319-12691-3_45","title":"A Fast Greedy Algorithm for the Critical Node Detection Problem","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Greedy algorithm; Cardinality (data modeling); Algorithm; Vertex (graph theory); Pairwise comparison; Computational complexity theory; Node (physics); Benchmark (surveying); Graph; Theoretical computer science; Data mining; Artificial intelligence","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.00190847,0.002519752,0.002853949,0.002280908,0.00172071,0.002186518,0.004858056,0.002793816,0.008722234],"category_scores_gemma":[0.008852274,0.001208208,0.001488702,0.003081304,0.001341647,0.003401909,0.004015082,0.00325536,0.003487533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001830328,"about_ca_system_score_gemma":0.004352407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005503717,"about_ca_topic_score_gemma":0.006229452,"domain_scores_codex":[0.9983422,0.0003724216,0.00009131748,0.0004336573,0.0005027959,0.0002575916],"domain_scores_gemma":[0.9952944,0.002940419,0.0002102736,0.0005763785,0.0006983213,0.0002802008],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001034307,0.0004573036,0.0009098127,0.0006543878,0.0001781571,0.0002393772,0.0002365782,0.2348367,0.009172726,0.0543057,0.0528612,0.6451137],"study_design_scores_gemma":[0.0003537849,0.0001366264,0.0002140057,0.00004381233,0.00007384286,0.0002089842,0.00007506104,0.8961623,0.002347695,0.09423129,0.006111068,0.00004140444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006041687,0.0005581385,0.9874823,0.0004137137,0.0002481183,0.0003003093,0.0002397167,0.001470135,0.003245809],"genre_scores_gemma":[0.06908002,0.000467412,0.9223986,0.0003676867,0.0002511788,0.0006569225,0.0009372946,0.000408778,0.005432071],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008722234,"threshold_uncertainty_score":0.0291788,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02038315314559135,"score_gpt":0.2565585156088256,"score_spread":0.2361753624632343,"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."}}