News & Views | Published:

Network science

Destruction perfected

Nature volume 524, pages 3839 (06 August 2015) | Download Citation

Pinpointing the nodes whose removal most effectively disrupts a network has become a lot easier with the development of an efficient algorithm. Potential applications might include cybersecurity and disease control. See Letter p.65

Access optionsAccess options

Rent or Buy article

Get time limited or full article access on ReadCube.

from$8.99

All prices are NET prices.

References

  1. 1.

    , & Nature 406, 378–382 (2000).

  2. 2.

    & Nature 524, 65–68 (2015).

  3. 3.

    & in Computers and Intractability: A Guide to the Theory of NP-completeness (Freeman, 1979).

  4. 4.

    Adv. Stud. Pure Math. 15, 211–280 (1989).

  5. 5.

    , & Phys. Rev. Lett. 113, 208702 (2014).

  6. 6.

    & Proc. 7th Int. World Wide Web Conf. 30, 107–117 (1998).

  7. 7.

    Soc. Networks 1, 215–239 (1978–79).

  8. 8.

    et al. Cell 161, 647–660 (2015).

Download references

Author information

Affiliations

  1. István A. Kovács and Albert-László Barabási are at the Center for Complex Network Research and in the Department of Physics, Northeastern University, Boston, Massachusetts 02115, USA.

    • István A. Kovács
    •  & Albert-László Barabási

Authors

  1. Search for István A. Kovács in:

  2. Search for Albert-László Barabási in:

Corresponding author

Correspondence to Albert-László Barabási.

About this article

Publication history

Published

DOI

https://doi.org/10.1038/524038a

Further reading

Comments

By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.

Newsletter Get the most important science stories of the day, free in your inbox. Sign up for Nature Briefing