An efficient representation of Benes networks and its applications

DOI10.1016/J.JDA.2006.08.003MaRDI QIDQ954947zbMATH OpenOpenAlexFDO

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

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

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

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
Publication:3620764

Cites work

scientific article; zbMATH DE number 52113 (Why is no real title available?)
scientific article; zbMATH DE number 3639144 (Why is no real title available?)
scientific article; zbMATH DE number 2010366 (Why is no real title available?)
An efficient representation of Benes networks and its applications
Landmarks in graphs
Metric dimension of directed graphs

Cited in

(27)

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

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)