Maximum information stored in a labeled connected network with minimum edges

Maximum information stored in a labeled connected network with minimum edges

0.00 Avg rating—0 Votes
Article ID: iaor20116096
Volume: 50
Issue: 3
Start Page Number: 473
End Page Number: 483
Publication Date: Jul 2011
Journal: Journal of Global Optimization
Authors:
Keywords: graphs, heuristics
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.

Reviews

Required fields are marked *. Your email address will not be published.