Efficient heuristic algorithm for identifying critical nodes in planar networks

Dalaijargal Purevsuren, Gang Cui. Efficient heuristic algorithm for identifying critical nodes in planar networks. Computers & OR, 106:143-153, 2019. [doi]

@article{PurevsurenC19,
  title = {Efficient heuristic algorithm for identifying critical nodes in planar networks},
  author = {Dalaijargal Purevsuren and Gang Cui},
  year = {2019},
  doi = {10.1016/j.cor.2019.02.006},
  url = {https://doi.org/10.1016/j.cor.2019.02.006},
  researchr = {https://researchr.org/publication/PurevsurenC19},
  cites = {0},
  citedby = {0},
  journal = {Computers & OR},
  volume = {106},
  pages = {143-153},
}