Loading...

Using shortcut edges to maximize the number of triangles in graphs

Dehghani, S ; Sharif University of Technology | 2015

384 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.orl.2015.09.003
  3. Publisher: Elsevier , 2015
  4. Abstract:
  5. In this paper, we consider the following problem: given an undirected graph G=(V,E) and an integer k, find I⊆V2 with |I|≤k in such a way that G'=(V,E∪I) has the maximum number of triangles (a cycle of length 3). We first prove that this problem is NP-hard and then give an approximation algorithm for it
  6. Keywords:
  7. Graph theory ; Following problem ; Graphs ; NP Complete ; NP-hard ; Number of triangles ; Triangles ; Undirected graph ; Approximation algorithms
  8. Source: Operations Research Letters ; Volume 43, Issue 6 , November , 2015 , Pages 586-591 ; 01676377 (ISSN)
  9. URL: http://www.sciencedirect.com/science/article/pii/S016763771500125X