Pages that link to "Item:Q5406188"
From MaRDI portal
The following pages link to Data reduction and exact algorithms for clique cover (Q5406188):
Displayed 27 items.
- Mod/Resc parsimony inference: theory and application (Q418168) (← links)
- On the kernel size of clique cover reductions for random intersection graphs (Q491163) (← links)
- Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy (Q690460) (← links)
- On the complete width and edge clique cover problems (Q721937) (← links)
- \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation (Q730482) (← links)
- Edge-clique covers of the tensor product (Q897963) (← links)
- Techniques for determining the minimum rank of a small graph (Q967515) (← links)
- Homothetic polygons and beyond: maximal cliques in intersection graphs (Q1671346) (← links)
- Calculating approximation guarantees for partial set cover of pairs (Q1676481) (← links)
- Fast constructive and improvement heuristics for edge clique covering (Q2019428) (← links)
- On the complexity of directed intersection representation of DAGs (Q2019504) (← links)
- On some FPT problems without polynomial Turing compressions (Q2072079) (← links)
- Unsupervised feature selection for efficient exploration of high dimensional data (Q2140450) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Parameterized low-rank binary matrix approximation (Q2218414) (← links)
- Large-scale clique cover of real-world networks (Q2288213) (← links)
- The graph motif problem parameterized by the structure of the input graph (Q2403795) (← links)
- Compressed cliques graphs, clique coverings and positive zero forcing (Q2636506) (← links)
- Kernelization – Preprocessing with a Guarantee (Q2908537) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
- Positive Zero Forcing and Edge Clique Coverings (Q4632169) (← links)
- Parameterized Low-Rank Binary Matrix Approximation (Q5002728) (← links)
- On the tractability of covering a graph with 2-clubs (Q5925691) (← links)
- Exact and parameterized algorithms for restricted subset feedback vertex set in chordal graphs (Q6111961) (← links)
- The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study (Q6125237) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)