Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters

@inproceedings{Bliznets2017ParameterizedAF,
  title={Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters},
  author={Ivan Bliznets and Nikolay Karpov},
  booktitle={MFCS},
  year={2017}
}
Clustering is a well-known and important problem with numerous applications. The graph-based model is one of the typical cluster models. In the graph model, clusters are generally defined as cliques. However, such an approach might be too restrictive as in some applications, not all objects from the same cluster must be connected. That is why different types of cliques relaxations often considered as clusters. In our work, we consider a problem of partitioning graph into clusters and a problem… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 25 references

, Stefan Kratsch , Marcin Pilipczuk , Michal Pilipczuk , and Yngve Villanger . Tight bounds for parameterized complexity of cluster editing with a small number of clusters

  • Fedor V. Fomin
  • J . Comput . Syst . Sci .
  • 2014

Fomin , Stefan Kratsch , Marcin Pilipczuk , Michal Pilipczuk , and Yngve Villanger . Tight bounds for parameterized complexity of cluster editing with a small number of clusters

  • V Fedor
  • J . Comput . Syst . Sci .
  • 2014

Distance - based clique relaxations in networks : s - clique and s - club . In Models , algorithms , and technologies for network analysis

  • Shahram Shahinpour, Sergiy Butenko
  • 2013

Distance-based clique relaxations in networks: s-clique and s-club. In Models, algorithms, and technologies for network analysis, pages 149–174

  • Shahram Shahinpour, Sergiy Butenko
  • 2013

Editing graphs

  • Jiong Guo, Iyad A Kanj, Christian Komusiewicz, Johannes Uhlmann
  • 2012

Similar Papers

Loading similar papers…