Pages that link to "Item:Q3983251"
From MaRDI portal
The following pages link to The complexity of clustering in planar graphs (Q3983251):
Displaying 32 items.
- Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (Q388791) (← links)
- A clustering approach to the planar hub location problem (Q689257) (← links)
- Constant factor approximation algorithms for the densest \(k\)-subgraph problem on proper interval graphs and bipartite permutation graphs (Q765501) (← links)
- A new perspective on clustered planarity as a combinatorial embedding problem (Q897898) (← links)
- A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs (Q963469) (← links)
- Network flow interdiction on planar graphs (Q987697) (← links)
- Clustering bipartite and chordal graphs: Complexity, sequential and parallel algorithms (Q1283779) (← links)
- \(k\)-plane clustering (Q1579945) (← links)
- Turning cliques into paths to achieve planarity (Q1725735) (← links)
- Planarity-preserving clustering and embedding for large planar graphs (Q1869744) (← links)
- Solving \(k\)-cluster problems to optimality with semidefinite programming (Q1925793) (← links)
- Quantum solutions for densest \(k\)-subgraph problems (Q1983021) (← links)
- Finding connected \(k\)-subgraphs with high density (Q2407097) (← links)
- The densest \(k\)-subgraph problem on clique graphs (Q2426654) (← links)
- Exact algorithms for problems related to the densest \(k\)-set problem (Q2448865) (← links)
- Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem (Q2514764) (← links)
- Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width (Q2891349) (← links)
- A PTAS for the Cluster Editing Problem on Planar Graphs (Q2971154) (← links)
- Approximation of the Quadratic Knapsack Problem (Q3186661) (← links)
- The Planar k-Means Problem is NP-Hard (Q3605504) (← links)
- (Q4501704) (← links)
- ON GENERIC COMPLEXITY OF THE GRAPH CLUSTERING PROBLEM (Q5151290) (← links)
- Planarity of Overlapping Clusterings Including Unions of Two Partitions (Q5371039) (← links)
- Clustered Planarity: Small Clusters in Eulerian Graphs (Q5452233) (← links)
- On solving the densest<i>k</i>-subgraph problem on large graphs (Q5859000) (← links)
- Graph Drawing (Q5897632) (← links)
- SOFSEM 2006: Theory and Practice of Computer Science (Q5898003) (← links)
- Semidefinite relaxations for partitioning, assignment and ordering problems (Q5917881) (← links)
- Parameterized algorithms for the happy set problem (Q5919103) (← links)
- Semidefinite relaxations for partitioning, assignment and ordering problems (Q5925162) (← links)
- FPT approximation and subexponential algorithms for covering few or many edges (Q6195348) (← links)
- The sparse sequences of graphs (Q6640961) (← links)