Pages that link to "Item:Q4217307"
From MaRDI portal
The following pages link to Approximating Clique and Biclique Problems (Q4217307):
Displaying 25 items.
- An exact exponential time algorithm for counting bipartite cliques (Q436594) (← links)
- A necessary condition for Nash equilibrium in two-person zero-sum constrained stochastic games (Q457853) (← links)
- Generating bicliques of a graph in lexicographic order (Q557825) (← links)
- Consensus algorithms for the generation of all maximal bicliques (Q705493) (← links)
- Finding biclusters by random projections (Q859851) (← links)
- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties (Q955347) (← links)
- An approximation ratio for biclustering (Q975394) (← links)
- A notion of cross-perfect bipartite graphs (Q1029000) (← links)
- The maximum edge biclique problem is NP-complete (Q1414242) (← links)
- Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations (Q1598763) (← links)
- Formulating logical implications in combinatorial optimisation (Q1598766) (← links)
- Complexity and approximations for submodular minimization problems on two variables per inequality constraints (Q1801066) (← links)
- Exact exponential-time algorithms for finding bicliques (Q1944039) (← links)
- On the complexity of minimum \(q\)-domination partization problems (Q2125219) (← links)
- Complexity of modification problems for reciprocal best match graphs (Q2290642) (← links)
- On independent sets and bicliques in graphs (Q2428684) (← links)
- Scale reduction techniques for computing maximum induced bicliques (Q2633172) (← links)
- Parameterized algorithms for edge biclique and related problems (Q2636505) (← links)
- Parameterized Algorithms for Maximum Edge Biclique and Related Problems (Q4632171) (← links)
- (Q4691855) (← links)
- (Q4691865) (← links)
- (Q5020552) (← links)
- (Q5026980) (← links)
- On Independent Sets and Bicliques in Graphs (Q5302053) (← links)
- On the generation of bicliques of a graph (Q5919931) (← links)
