Approximate association via dissociation (Q505447): Difference between revisions

From MaRDI portal
Merged Item from Q3181043
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Aggregating inconsistent information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast branching algorithm for cluster vertex deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural parameterizations for boxicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability of graph modification problems for hereditary properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster editing: kernelization based on edge cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering with qualitative information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant thresholds can make target set selection tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for hitting 3-vertex paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of the algorithmic aspects of modular decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter algorithms for cluster vertex deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node-deletion problem for hereditary properties is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge deletion problems: branching facilitated by modular decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular decomposition and transitive orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs indecomposable with respect to the X-join / rank
 
Normal rank
Property / cites work
 
Property / cites work: A factor \(2\) approximation algorithm for the vertex cover \(P_3\) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual approximation algorithm for the vertex cover \(P^3\) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Comparability Graph of a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-threshold graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank
 
Normal rank

Revision as of 04:32, 13 July 2024

scientific article; zbMATH DE number 6667975
  • Approximate Association via Dissociation
Language Label Description Also known as
English
Approximate association via dissociation
scientific article; zbMATH DE number 6667975
  • Approximate Association via Dissociation

Statements

Approximate association via dissociation (English)
0 references
Approximate Association via Dissociation (English)
0 references
0 references
0 references
0 references
23 January 2017
0 references
22 December 2016
0 references
association set
0 references
cluster vertex deletion
0 references
dissociation set
0 references
cluster graph
0 references
modular decomposition
0 references
triangle-free graph
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references