Pages that link to "Item:Q3434272"
From MaRDI portal
The following pages link to ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS (Q3434272):
Displayed 12 items.
- The cluster deletion problem for cographs (Q394219) (← links)
- The minimum spanning tree problem with conflict constraints and its variations (Q429679) (← links)
- Finding the closest ultrametric (Q476304) (← links)
- Complexity of the cluster deletion problem on subclasses of chordal graphs (Q496003) (← links)
- A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number (Q1799389) (← links)
- Analysis of an approximate greedy algorithm for the maximum edge clique partitioning problem (Q1926502) (← links)
- Cluster deletion on interval graphs and split related graphs (Q2037103) (← links)
- Indirect identification of horizontal gene transfer (Q2040274) (← links)
- Online clique clustering (Q2300728) (← links)
- Competitive Strategies for Online Clique Clustering (Q2947013) (← links)
- (Q5092370) (← links)
- Polyhedral results and stronger Lagrangean bounds for stable spanning trees (Q6110626) (← links)