Pages that link to "Item:Q505447"
From MaRDI portal
The following pages link to Approximate association via dissociation (Q505447):
Displaying 11 items.
- Vertex deletion problems on chordal graphs (Q1786595) (← links)
- Approximation algorithm for minimum connected 3-path vertex cover (Q2004079) (← links)
- Polyhedral properties of the induced cluster subgraphs (Q2022509) (← links)
- The maximum independent union of cliques problem: complexity and exact approaches (Q2174276) (← links)
- Improved approximation algorithms for hitting 3-vertex paths (Q2191773) (← links)
- (Q3181043) (redirect page) (← links)
- Vertex Deletion Problems on Chordal Graphs (Q5136314) (← links)
- A tight approximation algorithm for the cluster vertex deletion problem (Q5918432) (← links)
- A tight approximation algorithm for the cluster vertex deletion problem (Q5925651) (← links)
- Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)
- \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs (Q6145821) (← links)
