Using shortcut edges to maximize the number of triangles in graphs
Year of publication: |
November 2015
|
---|---|
Authors: | Dehghani, Sina ; Fazli, Mohammad Amin ; Habibi, Jafar ; Yazdanbod, Sadra |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 43.2015, 6, p. 586-591
|
Subject: | Triangles | Graphs | NP-complete | Approximation algorithm | Graphentheorie | Graph theory | Algorithmus | Algorithm |
-
Shen, Siqian, (2015)
-
Efficient heuristic algorithm for identifying critical nodes in planar networks
Purevsuren, Dalaijargal, (2019)
-
The complexity of computing the random priority allocation matrix
Saban, Daniela, (2015)
- More ...
-
A Black-Box Reduction in Mechanism Design with Private Cost of Capital
Balseiro, Santiago, (2019)
-
Fadei, Salman, (2011)
-
Noise-tolerant model selection and parameter estimation for complex networks
Aliakbary, Sadegh, (2015)
- More ...