Pages that link to "Item:Q360493"
From MaRDI portal
The following pages link to On finding \(k\)-cliques in \(k\)-partite graphs (Q360493):
Displaying 6 items.
- Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts (Q1634801) (← links)
- A new branch-and-filter exact algorithm for binary constraint satisfaction problems (Q2077912) (← links)
- Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph (Q2097180) (← links)
- The clique problem with multiple-choice constraints under a cycle-free dependency graph (Q2192065) (← links)
- On finding and enumerating maximal and maximum \( k\)-partite cliques in \( k\)-partite graphs (Q2633284) (← links)
- On atomic cliques in temporal graphs (Q6043101) (← links)
