Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

72

ISAAC
2009
Springer

84views Algorithms» more ISAAC 2009»

Editing Graphs into Disjoint Unions of Dense Clusters

15 years 10 months ago

Editing Graphs into Disjoint Unions of Dense Clusters

Download theinf1.informatik.uni-jena.de

Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Jo

Real-time Traffic

Algorithms | ISAAC 2009 |

claim paper

Related Content

» Going Weighted Parameterized Algorithms for Cluster Editing

» A More Relaxed Model for GraphBased Data Clustering sPlex Editing

» A More Effective Linear Kernelization for Cluster Editing

» Generalized Graph Clustering Recognizing p qCluster Graphs

» FixedParameter Enumerability of Cluster Editing and Related Problems

» Approximate Distance Oracles for Graphs with Dense Clusters

» Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems

» Clustering Partially Observed Graphs via Convex Optimization

» Clustering with partial information

Post Info
More Details (n/a)

Added	26 May 2010
Updated	26 May 2010
Type	Conference
Year	2009
Where	ISAAC
Authors	Jiong Guo, Iyad A. Kanj, Christian Komusiewicz, Johannes Uhlmann

Comments (0)