Finding the largest triangle in a graph in expected quadratic time
- 1 October 2020
- journal article
- research article
- Published by Elsevier in European Journal of Operational Research
- Vol. 286 (2) , 458-467
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Matching Triangles and Basing Hardness on an Extremely Popular ConjectureSIAM Journal on Computing, 2018
- Traveling salesman problem heuristics: Leading methods, implementations and latest advancesEuropean Journal of Operational Research, 2011
- TSPLIB—A Traveling Salesman Problem LibraryINFORMS Journal on Computing, 1991
- The Distribution of Means for Samples of Size N Drawn from a Population in which the Variate Takes Values Between 0 and 1, All Such Values Being Equally ProbableBiometrika, 1927