Minimum augmentation to tri-connect a bi-connected graph with upper bounds on vertex-degree | IEEE Conference Publication | IEEE Xplore