On graphs in which the Shannon capacity is unachievable by finite product.
Feng GuoYoichiro WatanabePublished in: IEEE Trans. Inf. Theory (1990)
Keyphrases
- information theory
- finite number
- complex structures
- expected profit
- product quality
- random graphs
- graph theoretic
- graph representation
- graph model
- graph mining
- graph structure
- graph matching
- directed graph
- weighted graph
- feature selection
- graph theory
- graph data
- product development
- production cost
- graph kernels
- life cycle
- holding cost
- capacity expansion
- pairwise