[2] A two-stages tree-searching algorithm for finding three completely independent spanning trees. Theoretical Computer Science (2019). [3] Constructing dual-CISTs of folded divide-and-swap cubes .

Night Writer February 6, 2016 01:05 pm >>A claim directly solely to this algorithm would not be patent-eligible. @5. That is the mistake. It should be patent eligible.

The spanning tree algorithm is used with Ethernet switches to routinely remove loop circuits. If these loops weren’t removed, a single IP packet carrying video could loop endlessly while consuming ...

With spanning tree it’s like taking the highway system and saying you don’t need both Rtes. 128 and 495 [to use local roads here in Massachusetts] just because they both sort of go in the same ...

Equally noteworthy is the development of a two-stage tree-searching algorithm that efficiently constructs three CISTs with controlled diameters in hypercube-variant networks, significantly ...