On Finding a Smallest Augmentation to Biconnect a Graph (Extended abstract)

Please use this identifier to cite or link to this item: http://ir.sinica.edu.tw/handle/201000000A/39046

Title:	On Finding a Smallest Augmentation to Biconnect a Graph (Extended abstract)
Authors:	T.-s. Hsu V. Ramachandran
Issue Date:	1991-12
Conference:	Proc. 2nd International Symp. on Algorithms
URI:	http://ir.sinica.edu.tw/handle/201000000A/39046
Appears in Collections:	資訊科學研究所

Show full item record

Last Week
0

Last month
0

checked on Jan 3, 2023

Check