Apr 14, 2018 · In this paper, we have shown that one can go from a given de Bruijn sequence to another by a sequence of leaf node edge switchings. By randomly ...
Now, by randomly performing a sequence of leaf node switches we can get a random spanning tree of Gn and therefore a random de Bruijn sequence. Example 5.
In this paper, we show that, if we fix the initial n bits, any n-th order de Bruijn sequence can be transformed to another using a sequence of transformations.
No information is available for this page. · Learn why
Suman Roy , Srinivasan Krishnaswamy, P. Vinod Kumar: On Leaf Node Edge Switchings in Spanning Trees of De Bruijn Graphs. ICMC 2018: 110-117.
People also ask
What are the edges of a spanning tree?
What are the vertices of a De Bruijn graph?
Apr 26, 2024 · On Leaf Node Edge Switchings in Spanning Trees of De Bruijn Graphs. ICMC 2018: 110-117. [i1]. view. electronic edition @ arxiv.org (open access) ...
On leaf node edge switchings inâ spanning trees of De Bruijn graphs. Communications in Computer and Information Science. 2018 | Book. DOI: 10.1007/978-981-13 ...
A 2-switch on a simple graph G consists of deleting two edges {u, v} and {x, y} of G and adding the edges {u, x} and {v, y}, provided the resulting graph is a ...
Even when the edges of a binary de Bruijn graph are given arbitrary weights, the TSP problem on binary de Bruijn graphs can be solved in O(nlogn) time. It is ...