scientific article; zbMATH DE number 7561656
From MaRDI portal
DOI10.4230/LIPIcs.MFCS.2019.12MaRDI QIDQ5092370
Charis Papadopoulos, Athanasios L. Konstantinidis
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
- The cluster deletion problem for cographs
- Graph clustering
- Complexity of the cluster deletion problem on subclasses of chordal graphs
- Correlation clustering
- Cluster editing with locally bounded modifications
- The splittance of a graph
- Cluster analysis and mathematical programming
- Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
- Cluster graph modification problems
- A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to \(P_4\)-sparse graphs
- Incidence matrices and interval graphs
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs
- ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS
- Printer graphics for clustering
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
- A Characterization of Comparability Graphs and of Interval Graphs
- On the relation of strong triadic closure and cluster deletion
