Uniform d‐emulations of rings, with an application to distributed virtual ring construction

DOI10.1002/NET.3230230405zbMATH Open0777.68025OpenAlexW1970060841MaRDI QIDQ5289366FDOQ5289366

Authors: E. M. Bakker, J. Van Leeuwen 

Publication date: 23 August 1993

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230230405

Recommendations

• The complexity of finding uniform emulations on paths and ring networks
• The complexity of finding uniform emulations on fixed graphs
• Uniform emulations of Cartesian-product and Cayley graphs
• An approach to emulating separable graphs

zbMATH Keywords

constructiondistributed algorithm for ringprocessor interconnection graphsvirtual ring network

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Cites Work

• Title not available (Why is that?)
• On the Cube of a Graph
• Hamiltonian Cycles in Squares of Vertex-Unicyclic Graphs

Cited In (2)

• The complexity of finding uniform emulations on fixed graphs
• The complexity of finding uniform emulations on paths and ring networks

This page was built for publication: Uniform d‐emulations of rings, with an application to distributed virtual ring construction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5289366)