Wormhole Routing in Networks Based on Cayley Graphs: A Performance Comparison. | NobleID

Main

Mint Work Search Explore Works Knowledge Graph Citation Graph Bibliometrics Receipts

v1

Wormhole Routing in Networks Based on Cayley Graphs: A Performance Comparison.

NobleID: NI7P47W54R57S83
Persistent link: https://nobleid.org/ark:/48914/w1/20260515/ABF6BA5D

Type:Journal Article

0 views

Support unavailableClaim Your Authorship

Embeddable Badge

[![NobleID](https://www.nobleid.org/api/badge/ABF6BA5D.svg?ark=w1%2F20260515%2FABF6BA5D&value=id)](https://nobleid.org/work/w1/20260515/ABF6BA5D)

ARK Inflections

Metadata Policy

Metadata Formats

Bibliometric Analysis

Impact metrics, research fronts, co-authorship networks →

Authors & Claims

Paper Authors

S. Lakshmivarahan

Sudarshan Dhall

Claim authorship of this work

info@nobleid.org

About FAQ Terms Policy Persistence & Resolver Service Policy