The generic complexity of the bounded problem of graphs clustering
From MaRDI portal
Recommendations
- On generic complexity of the graph clustering problem with bounded clusters
- ON GENERIC COMPLEXITY OF THE GRAPH CLUSTERING PROBLEM
- The generic complexity of the graph triangulation problem
- On the generic complexity of the searching graph isomorphism problem
- THE GENERAL COMPLEXITY OF THE PROBLEM TO RECOGNIZE HAMILTONIAN PATHS
Cites work
- Cluster graph modification problems
- Computational complexity of the graph approximation problem
- Correlation clustering
- Generic complexity of Presburger arithmetic
- Generic complexity of the Diophantine problem
- Generic complexity of undecidable problems
- Generic hardness of the Boolean satisfiability problem
- Generic-case complexity, decision problems in group theory, and random walks.
- scientific article; zbMATH DE number 3664741 (Why is no real title available?)
- scientific article; zbMATH DE number 1559537 (Why is no real title available?)
- NP-hard problems in hierarchical-tree clustering
- On a semi-supervised graph clustering problem
- ON GENERIC COMPLEXITY OF THE GRAPH CLUSTERING PROBLEM
- On the strongly generic undecidability of the halting problem
- THE GENERAL COMPLEXITY OF THE PROBLEM TO RECOGNIZE HAMILTONIAN PATHS
Cited in
(7)- Limitations on regularity lemmas for clustering graphs
- scientific article; zbMATH DE number 2011857 (Why is no real title available?)
- ON GENERIC COMPLEXITY OF THE GRAPH CLUSTERING PROBLEM
- THE GENERAL COMPLEXITY OF THE PROBLEM TO RECOGNIZE HAMILTONIAN PATHS
- The generic complexity of the graph triangulation problem
- SOFSEM 2006: Theory and Practice of Computer Science
- On generic complexity of the graph clustering problem with bounded clusters
This page was built for publication: The generic complexity of the bounded problem of graphs clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5871431)
