Probably Optimal Graph Motifs
نویسندگان
چکیده
We show an O∗(2k)-time polynomial space algorithm for the k-sized Graph Motif problem. We also introduce a new optimization variant of the problem, called Closest Graph Motif and solve it within the same time bound. The Closest Graph Motif problem encompasses several previously studied optimization variants, like Maximum Graph Motif, Min-Substitute, and Min-Add. Moreover, we provide a piece of evidence that our result might be essentially tight: the existence of an O∗((2− ))-time algorithm for the Graph Motif problem implies an O((2− ′)n)time algorithm for Set Cover. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems
منابع مشابه
Weighted Optimal Path in Graph with Multiple Indexes
This paper represents a technique for finding optimal paths with multiple indexes in a graph. Up to the present time, all optimal paths have been determined upon one index, say, distance for which an evaluation method exists. In this paper firstly we define multiple indexes for each edge in such a way that anyone can treat the factor for assigning an optimal path. Here, we use Data Envelopment ...
متن کاملSpatial Motifs for Device-to-Device Network Analysis (DNA) in Cellular Networks
Device-to-device (D2D) communication is a promising approach to efficiently disseminate critical or viral information. Reaping the benefits of D2D-enabled networks is contingent upon choosing the optimal content dissemination policy subject to resource and user distribution constraints. In this paper, a novel D2D network analysis (DNA) framework is proposed to study the impacts of frequently oc...
متن کاملCounting Motifs with Graph Sampling
Applied researchers often construct a network from data that has been collected from a random sample of nodes, with the goal to infer properties of the parent network from the sampled version. Two of the most widely used sampling schemes are subgraph sampling, where we sample each vertex independently with probability p and observe the subgraph induced by the sampled vertices, and neighborhood ...
متن کاملComment on ‘An optimal algorithm for counting networks motifs’ [Physica A 381 (2007) 482–490]
Network motifs in a given network are small connected subnetworks that occur at significantly higher frequencies thanwould be expected for a randomnetwork. In their 2007 article ‘‘An optimal algorithm for counting network motifs’’, Itzhack, Mogilevski, and Louzoun present an algorithm for detecting network motifs. Based on an experimental comparison with a motif detection software called FANMOD...
متن کاملA graph search algorithm: Optimal placement of passive harmonic filters in a power system
The harmonic in distribution systems becomes an important problem due to an increase in nonlinear loads. This paper presents a new approach based on a graph algorithm for optimum placement of passive harmonic filters in a multi-bus system, which suffers from harmonic current sources. The objective of this paper is to minimize the network loss, the cost of the filter and the total harmonic disto...
متن کامل