Pages that link to "Item:Q5233468"
From MaRDI portal
The following pages link to Data Reduction, Exact, and Heuristic Algorithms for Clique Cover (Q5233468):
Displaying 17 items.
- On the complete width and edge clique cover problems (Q721937) (← links)
- Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability (Q840834) (← links)
- Covering graphs with few complete bipartite subgraphs (Q1019181) (← links)
- Algorithms for compact letter displays: comparison and evaluation (Q1020871) (← links)
- Fast constructive and improvement heuristics for edge clique covering (Q2019428) (← links)
- On the intractability landscape of digraph intersection representations (Q2169961) (← links)
- Large-scale clique cover of real-world networks (Q2288213) (← links)
- Pairs Covered by a Sequence of Sets (Q2947882) (← links)
- Known Algorithms for Edge Clique Cover are Probably Optimal (Q3464061) (← links)
- Clustering with Partial Information (Q3599122) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- Редукция графа при поиске реберного покрытия минимальным числом клик (Q4959050) (← links)
- (Q5150561) (← links)
- A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs (Q5266610) (← links)
- Covering Graphs with Few Complete Bipartite Subgraphs (Q5458846) (← links)
- (Q6068263) (← links)
- Elements of Fuzzy Logic in Solving Clustering Problems (Q6106695) (← links)