Factoring cardinal product graphs in polynomial time.
Wilfried ImrichPublished in: Discret. Math. (1998)
Keyphrases
- graph isomorphism
- special case
- bounded treewidth
- graph theory
- graph matching
- graph model
- neural network
- polynomial time complexity
- directed graph
- planar graphs
- bounded degree
- series parallel
- product quality
- life cycle
- product information
- graph theoretic
- graph representation
- small world
- graph construction
- graph structures
- subgraph isomorphism
- spanning tree
- weighted graph
- worst case