No coin nor oath required. For personal study only.
Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs. 9: 507-537 CHIBA, NORISHIGE, AND NISHIZEKI, TAKAO. The Hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs. 10: 187-211 , , AND SAITO, NOBUJI. A linear 5-coloring algorithm of planar graphs. 2: 317-327 CHONG, KA WONG, AND LAM, TAK WAH. Finding connected components in O(log n log log n) time on the EREW PRAM. 18: 378-402 CHOU, CHING-TSUN, AND GOPAL, INDER S. Linear broadcast routing. 10: 490-517 CHROBAK, MAREK, AND LARMORE, LAWRENCE L. On fast algorithms for two servers. 12: 607-614 AND . Generosity helps or an 11-competitive algorithm for three servers. 16: 234-263 AND NISHIZEKI, TAKAO. Improved edge-coloring algorithms for planar graphs. 11: 102-116 AND YUNG, MOTI. Fast algorithms for edge-coloring planar graphs. 10: 35-51 CHU, JEFF. Optimal algorithm for the nearest common dominator problem. 13: 693-697 CHUNG, MOON JUNG. O(n 2.5 ) time algorithms for the subgraph homeomorphism problem on trees. 8: 106-112
📜 SIMILAR VOLUMES
A 27 Al MQMAS NMR of mechanically treated bayerite and silica mixtures, 20, 87 Alkali niobates 93 Nb MQMAS NMR, 19, 45 ␣-Aluminum hydroxide bayerite, mechanically treated mixtures with silica, 27 Al MQMAS NMR, 20, 87 Ammonium periodate high-field 127 I NMR structural study, 20, 100 Ammonium persulfa