✦ LIBER ✦

Universal traversal sequences for expander graphs

✍ Scribed by Shlomo Hoory; Avi Wigderson

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 237 KB
Volume: 46
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(93)90199-j

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Universal traversal sequences for paths

Universal traversal sequences for paths and cycles

✍ Michael F Bridgland 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 552 KB

Traversable wormhole in the expanding un

Traversable wormhole in the expanding universe

✍ Koichi Narahara; Yasuhiko Furihata; Katsuhiko Sato 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 261 KB

A lower bound for area-universal graphs

✍ Gianfranco Bilardi; Shiva Chaudhuri; Devdatt Dubhashi; K. Mehlhorn 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 525 KB

Conflict-free broadcasting algorithms fo

Conflict-free broadcasting algorithms for graph traversals and their applications

✍ Gen-Huey Chen; Wei-Wen Liang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 696 KB

A fast graph traversal algorithm for the

A fast graph traversal algorithm for the computer enumeration of P-V paths of benzenoid graphs

✍ M.M. Balakrishnarajan; P. Venuvanalingam 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 493 KB

Universal circuit matrix for adjacency g

Universal circuit matrix for adjacency graphs of feedback functions

✍ Jerzy Żurawiecki 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 267 KB

We define the class of undirected graphs associated with the feedback functions. Next, we construct a mapping which transforms a given feedback function into the circuit matrix of the corresponding graph. This mapping establishes some linear dependences between the nonlinear feedback functions, so i