Maximum information stored in a labeled connected network with minimum edges

  • Authors:

  • Chao-Lin Chen

  • Affiliations:

  • Electronic Engineering Department, Oriental Institute of Technology, Taipei, Taiwan, ROC

  • Venue:
  • Journal of Global Optimization
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Given a set X, we consider the problem of finding a graph G with vertex set X and the minimum number of edges such that for i = 1, . . . , m, the subgraph G i induced from pattern i is a label connected graph with minimum edges. In the paper, we show that the problem is NP hard and develop a heuristic algorithm to get a fewer number of edges to store patterns.