Embedding longest fault-free paths in arrangement graphs with faulty vertices.
Ray-Shang LoGen-Huey ChenPublished in: Networks (2001)
Keyphrases
- fault diagnosis
- weighted graph
- multiple faults
- labeled graphs
- random graphs
- graph embedding
- fault model
- undirected graph
- shortest path
- attributed graphs
- repair actions
- spectral embedding
- fault detection
- hamiltonian cycle
- adjacency matrix
- graph theoretic
- average degree
- planar graphs
- edge weights
- graph theory
- maximal cliques
- normal operation
- directed edges
- graph matching
- directed graph
- vector space
- connected subgraphs
- maximum cardinality
- connected graphs
- expert systems
- subgraph isomorphism
- graph partitioning
- bipartite graph
- neural network
- minimum weight
- graph clustering
- model based diagnosis
- graph model
- low dimensional
- nodes of a graph