Skip to main navigation
Skip to search
Skip to main content
Montclair State University Home
Help & FAQ
Home
Profiles
Research units
Core Facilities
Grants/Projects
Research output
Prizes
Press/Media
Search by expertise, name or affiliation
The structure fault tolerance of arrangement graphs
Guozhen Zhang,
Dajin Wang
Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
9
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'The structure fault tolerance of arrangement graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Arrangement Graph
100%
Connected Subgraphs
100%
Structure Fault Tolerance
100%
Cardinality
50%
Interconnection Networks
50%
Multiprocessor Systems
50%
Computer Networks
50%
Multiprocessor
50%
H1-H2
50%
Structure Connectivity
50%
Structure H
50%
Substructure Connectivity
50%
Connected Graph
50%
2-step
50%
Underlying Topology
50%
Interest Structure
50%
Multicomputer
50%
Computer Science
fault-tolerance
100%
Connected Subgraph
100%
Cardinality
50%
multi-processor
50%
Multiprocessor System
50%
Computer Network
50%
Connected Graph
50%
Desirable Property
50%
Interconnection Network
50%
Mathematics
Cardinality
100%
Connected Graph
100%
Desirable Property
100%