Metric space method for constructing splitting partitions of graphs

[1] R. Carraghan, P. M. Pardalos, An exact algorithm for the maximum clique problem, Operation Research Letters9 (1990), 375–382. ⇒135Search in Google Scholar

[2] M. R. Garey, D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, New York, 2003. ⇒132Search in Google Scholar

[3] P. R. J.Östergård, A fast algorithm for the maximum clique problem, Discrete Applied Mathematics120 (2002), 197–207. ⇒135Search in Google Scholar

[4] C. H. Papadimitriou, Computational Complexity, Addison-Wesley Publishing Company, Inc., Reading, MA 1994. ⇒132Search in Google Scholar

[5] N. J. A. Sloane, Challenge Problems: Independent sets in graphs, http://neilsloane.com/doc/graphs.html ⇒140Search in Google Scholar

[6] S. Szabó, Parallel algorithms for finding cliques in a graph,, Journal of Physics, Conference Series268 (2011) 012030 DOI:10.1088/1742-6596/268/1/012030. ⇒131, 133, 14010.1088/1742-6596/268/1/012030.131,133140Open DOISearch in Google Scholar

[7] S. Szabó, Monoton matrices and finding cliques in a graph, Annales Univ. Sci. Budapest., Sect. Computatorica41 (2013), 307–322. ⇒Search in Google Scholar

[8] E. W. Weisstein, Monotonic Matrix, In: MathWorld–A Wolfram Web Resource.http://mathworld.wolfram.com/MonotonicMatrix.html ⇒140Search in Google Scholar