Pages that link to "Item:Q2026994"
From MaRDI portal
The following pages link to Computing maximum \(k\)-defective cliques in massive graphs (Q2026994):
Displaying 3 items.
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375) (← links)
- Fast Cluster Detection in Networks by First Order Optimization (Q5065475) (← links)
- A branch-and-cut approach to solve the fault diagnosis problem with lazy spread and imperfect system information (Q6568395) (← links)