Correlation clustering and two-edge-connected augmentation for planar graphs
From MaRDI portal
Publication:6046943
Recommendations
- Correlation clustering and two-edge-connected augmentation for planar graphs
- scientific article; zbMATH DE number 1500683
- Planarity-preserving clustering and embedding for large planar graphs
- Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
- scientific article; zbMATH DE number 1187145
- Subgraph induced planar connectivity augmentation (extended abstract)
- scientific article; zbMATH DE number 2084266
- Augmenting the connectivity of planar and geometric graphs
- Augmenting the connectivity of planar and geometric graphs
- Two-Connected Augmentation Problems in Planar Graphs
Cites work
- Title not available (Why is no real title available?)
- scientific article; zbMATH DE number 1003253 (Why is no real title available?)
- scientific article; zbMATH DE number 1263259 (Why is no real title available?)
- scientific article; zbMATH DE number 1305417 (Why is no real title available?)
- scientific article; zbMATH DE number 1979495 (Why is no real title available?)
- scientific article; zbMATH DE number 2079404 (Why is no real title available?)
- scientific article; zbMATH DE number 5032352 (Why is no real title available?)
- A factor 2 approximation algorithm for the generalized Steiner network problem
- A polynomial-time approximation scheme for planar multiway cut
- A primal-dual approximation algorithm for generalized Steiner network problems
- Aggregating inconsistent information: ranking and clustering
- Approximation Algorithms for Graph Augmentation
- Approximation Algorithms for Several Graph Augmentation Problems
- Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
- Biconnectivity approximations and graph carvings
- Clustering with qualitative information
- Correlation clustering
- Correlation clustering and two-edge-connected augmentation for planar graphs
- Correlation clustering in general weighted graphs
- Correlation clustering with a fixed number of clusters
- Correlation clustering with noisy input
- Correlation clustering, maximizing agreements via semidefinite programming
- Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
- Hardness of Approximation for Vertex-Connectivity Network Design Problems
- Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs
- Multiple-source single-sink maximum flow in directed planar graphs in \(O(\mathrm{diameter} \cdot n \log n)\) time
- Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs
- Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs
- The Two-Edge Connectivity Survivable Network Problem in Planar Graphs
- Two-Connected Augmentation Problems in Planar Graphs
This page was built for publication: Correlation clustering and two-edge-connected augmentation for planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6046943)
