Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract)

Pei-Chi Huang, Hsin-Wen Wei, Yen-Chiu Chen, Ming-Yang Kao, Wei Kuan Shih, Tsan-sheng Hsu. Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract). In Yingfei Dong, Ding-Zhu Du, Oscar H. Ibarra, editors, Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings. Volume 5878 of Lecture Notes in Computer Science, pages 1195-1204, Springer, 2009. [doi]

@inproceedings{HuangWCKSH09,
  title = {Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract)},
  author = {Pei-Chi Huang and Hsin-Wen Wei and Yen-Chiu Chen and Ming-Yang Kao and Wei Kuan Shih and Tsan-sheng Hsu},
  year = {2009},
  doi = {10.1007/978-3-642-10631-6_120},
  url = {http://dx.doi.org/10.1007/978-3-642-10631-6_120},
  tags = {constraints, graph-rewriting, rewriting, partitioning},
  researchr = {https://researchr.org/publication/HuangWCKSH09},
  cites = {0},
  citedby = {0},
  pages = {1195-1204},
  booktitle = {Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings},
  editor = {Yingfei Dong and Ding-Zhu Du and Oscar H. Ibarra},
  volume = {5878},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-10630-9},
}