Pages that link to "Item:Q3652186"
From MaRDI portal
The following pages link to Exact Algorithms for Dominating Clique Problems (Q3652186):
Displaying 8 items.
- An exact exponential time algorithm for counting bipartite cliques (Q436594) (← links)
- On the complexity of fixed parameter clique and dominating set (Q703534) (← links)
- Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs (Q805638) (← links)
- Exact algorithms for the minimum cost vertex blocker clique problem (Q1634092) (← links)
- \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates (Q1804563) (← links)
- Fast exact algorithms for some connectivity problems parameterized by clique-width (Q2420640) (← links)
- An Exact Algorithm for the Minimum Dominating Clique Problem (Q3499731) (← links)
- Moderately Exponential Approximation: Bridging the Gap Between Exact Computation and Polynomial Approximation (Q4596147) (← links)
