. Author manuscript; available in PMC: 2014 Jan 13.

Published in final edited form as: Inf inference. 2012 Dec;1(1):21. doi: 10.1093/imaiai/ias002

Table 5.

Running times (in seconds) of the 3D-SP-ASAP algorithm for the BRIDGE-DONUT graph with n=500 nodes, η =0%, 35%, deg=18, 21, and k =8, 25 partitions. For η =0% we embed the patches using FULL-SDP, while for η =35% we use SNL-SDP since the regularization term improves the localization

Number of partitions k	k = 8		k = 25

Noise level η	0%	35%	35%
Spectral partitioning	0.3	0.3	0.7
Finding WUL subgraphs	48	81	89
Embedding FULL-SDP	53	(82)	(89)
Embedding SNL-SDP	(26)	50	86
Step 1 (ℤ₂ × SO(3))	1	1	1
Step 2 (least squares)	6	8	9
Total	108	140	186