A Linear Time Algorithm for Bi-Connectivity Augmentation of Graphs with Upper Bounds on Vertex-Degree Increase

Takanori Fukuoka, Toshiya Mashima, Satoshi Taoka, Toshimasa Watanabe. A Linear Time Algorithm for Bi-Connectivity Augmentation of Graphs with Upper Bounds on Vertex-Degree Increase. IEICE Transactions, 88-A(4):954-963, 2005. [doi]

@article{FukuokaMTW05,
  title = {A Linear Time Algorithm for Bi-Connectivity Augmentation of Graphs with Upper Bounds on Vertex-Degree Increase},
  author = {Takanori Fukuoka and Toshiya Mashima and Satoshi Taoka and Toshimasa Watanabe},
  year = {2005},
  doi = {10.1093/ietfec/e88-a.4.954},
  url = {http://dx.doi.org/10.1093/ietfec/e88-a.4.954},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/FukuokaMTW05},
  cites = {0},
  citedby = {0},
  journal = {IEICE Transactions},
  volume = {88-A},
  number = {4},
  pages = {954-963},
}