On finding \(k\)-cliques in \(k\)-partite graphs

DOI10.1007/s11590-012-0536-yzbMath1276.90061MaRDI QIDQ360493

Mohammad Mirghorbani, Pavlo A. Krokhmal

Publication date: 27 August 2013

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-012-0536-y

zbMATH Keywords

\(k\)-clique; \(k\)-partite graph; bit parallelism; maximum clique enumeration problem

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C27: Combinatorial optimization

Related Items

On atomic cliques in temporal graphs, Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts, A new branch-and-filter exact algorithm for binary constraint satisfaction problems, Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph, The clique problem with multiple-choice constraints under a cycle-free dependency graph, On finding and enumerating maximal and maximum \( k\)-partite cliques in \( k\)-partite graphs

Cites Work

• Unnamed Item
• An exact bit-parallel algorithm for the maximum clique problem
• Asymptotic behavior of the expected optimal value of the multidimensional assignment problem
• Bit-parallel witnesses and their applications to approximate string matching
• Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time
• Bit-parallel approximate string matching algorithms with transposition
• Computational Studies of Randomized Multidimensional Assignment Problems
• Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering