Add time:08/04/2019 Source:sciencedirect.com
Given a graph G = (V, E) and two positive integers l and k, an l-triangle k-club is a subset of nodes that induces a subgraph with each node included in at least l triplets linked pairwise and maximum distance between each pair of nodes at most k. This structure aims to represent cohesive groups in social and other complex networks. The Maximum l-Triangle k-Club Problem (MlTkCP) consists of finding a maximum cardinality l-triangle k-club of a given graph. In this paper, we derive properties of l-triangle k-clubs and show that the decision version of the MlTkCP is NP-Complete, for any given integers l ≥ 1 and k ≥ 2. To solve the problem, polynomial and non-polynomial formulations designed in different variable spaces are considered. The computational performance of exact solution approaches based on them is tested on a set of real-world graphs.
We also recommend Trading Suppliers and Manufacturers of K 259-3 (cas 127172-90-1). Pls Click Website Link as below: cas 127172-90-1 suppliers
About|Contact|Cas|Product Name|Molecular|Country|Encyclopedia
Message|New Cas|MSDS|Service|Advertisement|CAS DataBase|Article Data|Manufacturers | Chemical Catalog
©2008 LookChem.com,License: ICP
NO.:Zhejiang16009103
complaints:service@lookchem.com Desktop View