Minimum 2-Terminal Routing In 2-Jump Circulant Graphs

摘要

A 2-jump circulant is an undirected graph whose nodes are integers 0, 1,..., n - 1 and each node u is adjacent to four nodes u±h1 (mod n), u± h2(mod n), where 0