National Repository of Grey Literature 2 records found  Search took 0.00 seconds. 
Graph labeling
Böhm, Martin ; Mareš, Martin (advisor) ; Balyo, Tomáš (referee)
We introduce the concept of adjacency labeling schemes and recent results in the area. These schemes have practical application in parallel algorithm design and they relate to the theory of universal graphs. We concentrate on the modern technique of "Traversal and Jumping". We present a less technical proof of its correctness as well as correcting some errors in the original proof. We also apply brute-force algorithms to find small induced-universal graphs. 1
Graph labeling
Böhm, Martin ; Mareš, Martin (advisor) ; Balyo, Tomáš (referee)
We introduce the concept of adjacency labeling schemes and recent results in the area. These schemes have practical application in parallel algorithm design and they relate to the theory of universal graphs. We concentrate on the modern technique of "Traversal and Jumping". We present a less technical proof of its correctness as well as correcting some errors in the original proof. We also apply brute-force algorithms to find small induced-universal graphs. 1

Interested in being notified about new results for this query?
Subscribe to the RSS feed.