Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992)

No abstract is available for this paper.

• Publication year

  1992

• Venue

  SIGA

• Publication date

  1992-06-30

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1145/141914.990672
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• No references are available for this paper.

• The disjoint path cover in the data center network HSDC with prescribed vertices in each path

  2023cites this paper
• Enhanced Algorithm for Logical Topology-Based Fault Link Recovery in Crossbar Networks

  2020cites this paper
• Fault-Tolerant Hamiltonicity and Hamiltonian Connectivity of BCube with Various Faulty Elements

  2020cites this paper
• Factorizations of the product of cycles

  2019cites this paper
• Power Domination in Knödel Graphs and Hanoi Graphs

  2018cites this paper
• On the Channel Congestion of the Shortest-Path Routing for Unidirectional Hypercube Networks

  2018cites this paper
• Fast Wavelet Tree Construction in Practice

  2018cites this paper
• Diagnosable evaluation of enhanced optical transpose interconnection system networks

  2017cites this paper
• Hamiltonian paths in hypercubes with local traps

  2017cites this paper
• The S-labeling problem: An algorithmic tour

  2017cites this paper
• Cycles embedding in folded hypercubes under the conditional fault model

  2017cites this paper
• Fault-tolerant edge-bipancyclicity of faulty hypercubes under the conditional-fault model

  2016cites this paper
• lOOxlOO Fiber Cross-connect Circuit Using VCSEL.based Links

  2016cites this paper
• Edge-fault-tolerant pancyclicity and bipancyclicity of Cartesian product graphs with faulty edges

  2016cites this paper
• The k-ary n-direct s-indirect family of topologies for large-scale interconnection networks

  2016cites this paper
• Vertex-fault-tolerant cycles embedding on enhanced hypercube networks

  2016cites this paper
• Certain height-balanced subtrees of hypercubes

  2016cites this paper
• Vertex-fault-tolerant cycles embedding in 4-conditionally faulty folded hypercubes

  2016cites this paper
• Complete Cycle Embedding in Crossed Cubes with Two-Disjoint-Cycle-Cover Pancyclicity

  2015cites this paper
• The bicube: an interconnection of two hypercubes

  2015cites this paper
• Unchanging the diameter of k-ary n-cube networks with faulty vertices

  2015cites this paper
• Addition is exponentially harder than counting for shallow monotone circuits

  2015cites this paper
• The Fault-Tolerant Hamiltonian Problems of Crossed Cubes with Path Faults

  2015cites this paper
• Developing Peace, Economy with Probe Networks across the Taiwan Strait from the Kinmen-Xiamen Cross-Border City

  2015cites this paper
• Algorithmic Aspects of the S-Labeling Problem

  2015cites this paper
• Linear Layout of Directed Grid Graph

  2015cites this paper
• 2-Disjoint-path-coverable panconnectedness of crossed cubes

  2015cites this paper
• Embedding multidimensional grids into optimal hypercubes

  2014cites this paper
• On the incidence coloring number of folded hypercubes

  2014cites this paper
• On the Hamiltonicity of the KCube Interconnection Network

  2014cites this paper
• Searching for a black hole in interconnected networks using mobile agents and tokens

  2014cites this paper
• Extended fault-tolerant bipanconnectivity and panconnectivity of folded hypercubes

  2014cites this paper
• Random Walks, Bisections and Gossiping in Circulant Graphs

  2014cites this paper
• Edge-Disjoint Fibonacci Trees in Hypercube

  2014cites this paper
• Blocking probability of f-cast optical banyan networks on vertical stacking

  2014cites this paper
• Hyper‐star graphs: Some topological properties and an optimal neighbourhood broadcasting algorithm

  2014cites this paper
• A Linear Time Pessimistic Diagnosis Algorithm for Hypermesh Multiprocessor Systems under the PMC Model

  2014cites this paper
• On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube

  2014cites this paper
• Improving the panconnectedness property of locally twisted cubes

  2014cites this paper
• The Well-Connected Processor Array

  2014cites this paper
• On counting and embedding a subclass of height-balanced trees

  2014cites this paper
• A Three-Round Adaptive Diagnostic Algorithm in a Distributed System Modeled by Dual-Cubes

  2014cites this paper
• Disjoint cycles in hypercubes with prescribed vertices in each cycle

  2013cites this paper
• Space-efficient parallel algorithms for combinatorial search problems

  2013cites this paper
• Complexity of Linear Circuits and Geometry

  2013cites this paper
• SUPER STRONGLY PERFECT NESS OF SOME INTERCONNECTION

  2013cites this paper
• Two Systematic Methods for Generating Paths in Twisted Cube Networks

  2013cites this paper
• Dynamic-width reconfigurable parallel prefix circuits

  2013cites this paper
• Accurate Parallel Floating-Point Accumulation

  2013cites this paper
• On Embedding of Certain Recursive Trees and Stars into Hypercube

  2013cites this paper
• Recent Advances in Graph Partitioning

  2013cites this paper
• Cluster-Composition Graphs: t/t-Diagnosabilty and its Application

  2013cites this paper
• Parallel butterfly sorting algorithm on GPU

  2013cites this paper
• A Fault-Tolerant Optimal Message Routing Methodology for Cube-Connected-Cycles Parallel Computers

  2013cites this paper
• Parallel transitive closure algorithm

  2013cites this paper
• Topological properties of folded hyper-star networks

  2012cites this paper
• A Lower Bound Technique for Communication on BSP with Application to the FFT

  2012cites this paper
• Random Walks and Bisections in Random Circulant Graphs

  2012cites this paper
• Minimum Cycle Covers of Butterfly and Benes Networks

  2012cites this paper
• Beyond Good Partition Shapes: An Analysis of Diffusive Graph Partitioning

  2012cites this paper
• The g-good-neighbor conditional diagnosability of hypercube under PMC model

  2012cites this paper
• Scheduling and routing of autonomous moving objects on a mesh topology

  2012cites this paper
• Testing connectivity of faulty networks in sublinear time

  2012cites this paper
• DPillar: Dual-port server interconnection network for large scale data centers

  2012cites this paper
• Edge Decompositions of Hypercubes by Paths and by Cycles

  2012cites this paper
• Many-to-many disjoint paths in hypercubes with faulty vertices

  2012cites this paper
• An OpenCL Method of Parallel Sorting Algorithms for GPU Architecture

  2012cites this paper
• Adaptive diagnosis for torus systems under the comparison model

  2012cites this paper
• Fast Parallel Sorting Algorithms on GPUs

  2012cites this paper
• Fully Homomorphic Encryption with Polylog Overhead

  2012cites this paper
• Bipancyclic Properties of Faulty Hypercubes

  2012cites this paper
• Bipanconnectivity of faulty hypercubes with minimum degree

  2012cites this paper
• Vertex-pancyclicity of twisted cubes with maximal faulty edges

  2012cites this paper
• Multiparty Session C: Safe Parallel Programming with Message Optimisation

  2012cites this paper
• Homogeneous and Heterogeneous Traffic of Data Packets on Complex Networks: The Traffic Congestion Phenomenon

  2012cites this paper
• On Scalability of Routing Tables in Dense Flat-Label Wireless Networks

  2011cites this paper
• Randomized Shellsort: A Simple Data-Oblivious Sorting Algorithm

  2011cites this paper
• Optimal adaptive parallel diagnosis for a distributed system modeled by dual-cubes

  2011cites this paper
• A survey of comparison-based system-level diagnosis

  2011cites this paper
• Fault-free mutually independent Hamiltonian cycles of faulty star graphs

  2011cites this paper
• A note on cycle embedding in hypercubes with faulty vertices

  2011cites this paper
• The Edge-Fault-Tolerant Bipancyclicity of the Even k-ary n-cube

  2011cites this paper
• An Optimal Hidden-Surface Algorithm and Its Parallelization

  2011cites this paper
• Algebraic Models of Constant Node Degree Interconnection Networks

  2011cites this paper
• On Centralized Smooth Scheduling

  2011cites this paper
• Landmarks in Binary Tree Derived Architectures

  2011cites this paper
• CHC: A Robust P2P Overlay Network with Simple Routing and Small-World Features

  2011cites this paper
• An Adaptive Diagnostic Algorithm for a Distributed System Modeled by Dual-cubes

  2011cites this paper
• Finding a Hamiltonian Cycle in a Hierarchical Dual-Net with Base Network of p -Ary q -Cube

  2011cites this paper
• Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs

  2011cites this paper
• Computational models for networks of tiny artifacts: A survey

  2011cites this paper
• Scalable and Cost-Effective Interconnection of Data-Center Servers Using Dual Server Ports

  2011cites this paper
• Biswapped networks: a family of interconnection architectures with advantages over swapped or OTIS networks

  2011cites this paper
• Bottleneck Routing Games on Grids

  2011cites this paper
• On the Crossing Number of Generalized Fat Trees

  2011cites this paper
• Impact of Reconfigurable Function on Meshes with Row/Column Buses

  2011cites this paper
• Embedding double starlike trees into hypercubes

  2011cites this paper
• Parity vertex colouring of graphs

  2011cites this paper
• Succinct representations of permutations and functions

  2011cites this paper
• Optical buffering up to 160 Gb/s employing a quantum dot semiconductor optical amplifier-based architecture

  2011cites this paper