Pages that link to "Item:Q290198"
From MaRDI portal
The following pages link to An approximation algorithm for clustering graphs with dominating diametral path (Q290198):
Displaying 10 items.
- Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs (Q805638) (← links)
- Clustering bipartite and chordal graphs: Complexity, sequential and parallel algorithms (Q1283779) (← links)
- Treewidth for graphs with small chordality (Q1372729) (← links)
- Algorithms for graphs with small octopus (Q1421464) (← links)
- A 2-approximation algorithm for the graph 2-clustering problem (Q2181769) (← links)
- Exact algorithms for the minimum \(s\)-club partitioning problem (Q2329904) (← links)
- A clustering method to identify representative financial ratios (Q2476753) (← links)
- Algorithms for Cluster Busting in Anchored Graph Drawing (Q4386509) (← links)
- Dynamic Digraph Connectivity Hastens Minimum Sum-of-Diameters Clustering (Q4652636) (← links)
- Evaluating financial performance of Taiwan container shipping companies by strength and weakness indices (Q5852120) (← links)
