An efficient representation of Benes networks and its applications

DOI10.1016/J.JDA.2006.08.003zbMATH Open1159.05307OpenAlexW2067587105MaRDI QIDQ954947FDOQ954947

Authors: Mostafa I. Abd-El-Barr, Indra Rajasingh, Paul Manuel, Bharati Rajan

Publication date: 18 November 2008

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2006.08.003

Recommendations

VLSI layout of Benes networks
On minimum metric dimension of honeycomb networks
Metric dimension of directed graphs
On the fault-tolerant metric dimension of certain interconnection networks
scientific article

zbMATH Keywords

butterfly network bipartite graphs Benes network \(NP\)-hard problem minimum metric dimension problem

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Landmarks in graphs
An efficient representation of Benes networks and its applications
Metric dimension of directed graphs

Cited In (27)

On excessive index of certain networks
On topological indices for new classes of Benes network
Conditional resolvability of honeycomb and hexagonal networks
On degree-based topological indices of symmetric chemical structures
Embedding circulant networks into butterfly and benes networks
Metric dimension for amalgamations of graphs
A comparative study of the Benes filtering problem
On topological indices of certain interconnection networks
\( [ 1 , 2 ]\)-dimension of graphs
On topological properties of poly honeycomb networks
On the metric dimension of circulant and Harary graphs
Resolving-power dominating sets
On topological indices of fullerenes
An efficient representation of Benes networks and its applications
On some degree-based irregularity indices of certain networks
VLSI layout of Benes networks
Metric dimension of directed graphs
Information Security and Cryptology - ICISC 2005
Redefining fractal cubic networks and determining their metric dimension and fault-tolerant metric dimension
On topological properties of hierarchical interconnection networks
Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications
The Benes Network is q*(q-1)/2n-Almost q-set-wise Independent
Twin vertices in fault-tolerant metric sets and fault-tolerant metric dimension of multistage interconnection networks
Computing topological indices of sudoku graphs
On topological properties of Sierpinski networks
On the isometric path partition problem
On the strong metric dimension of tetrahedral diamond lattice

This page was built for publication: An efficient representation of Benes networks and its applications

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