Finding a Smallest Augmentation to Biconnect a Graph

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

Title:	Finding a Smallest Augmentation to Biconnect a Graph
Authors:	T.-s. Hsu V. Ramachandran
Issue Date:	1991-01
Relation:	SIAM Journal on Computing 22(5), 889-912
URI:	http://ir.sinica.edu.tw/handle/201000000A/40740
ISSN:	http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=Drexel&SrcApp=hagerty_opac&KeyRecord=0097-5397&DestApp=JCR&RQ=IF_CAT_BOXPLOT
Appears in Collections:	資訊科學研究所

Show full item record

Last Week
0

Last month
3

checked on Jun 13, 2025

Check