On finding k-cliques in k-partite graphs

DOI10.1007/S11590-012-0536-YMaRDI QIDQ360493zbMATH OpenOpenAlexFDO

Authors 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 graphbit parallelismmaximum clique enumeration problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• On finding and enumerating maximal and maximum \( k\)-partite cliques in \( k\)-partite graphs
• Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering
• Finding a Maximum Clique in an Arbitrary Graph
• Finding maximum cliques in arbitrary and in special graphs
• Algorithm Theory - SWAT 2004

Cites work

• An exact bit-parallel algorithm for the maximum clique problem
• Asymptotic behavior of the expected optimal value of the multidimensional assignment problem
• Bit-parallel approximate string matching algorithms with transposition
• Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time
• Bit-parallel witnesses and their applications to approximate string matching
• Computational studies of randomized multidimensional assignment problems
• Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering
• scientific article; zbMATH DE number 6118217 (Why is no real title available?)

Cited in

(8)

• 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 a k-clique-join of a class of partitionalble graphs
• On finding and enumerating maximal and maximum \( k\)-partite cliques in \( k\)-partite graphs
• Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering
• On atomic cliques in temporal graphs

This page was built for publication: On finding \(k\)-cliques in \(k\)-partite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q360493)