English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs

MPS-Authors
/persons/resource/persons45020

Megow,  Nicole
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45251

Raman,  Rajiv
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Correa, J. R., Megow, N., Raman, R., & Suchan, K. (2009). Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs. In 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (pp. 347-350). Paris: CNAM.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-1817-A
Abstract
There is no abstract available