Graph clustering I: Cycles of cliques
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 158-168
- https://doi.org/10.1007/3-540-63938-1_59
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Graph Decomposition is NP-Complete: A Complete Proof of Holyer's ConjectureSIAM Journal on Computing, 1997
- The complexity of restricted graph homomorphismsDiscrete Mathematics, 1997
- Graph-Drawing contest reportPublished by Springer Nature ,1997
- Straight-line drawing algorithms for hierarchical graphs and clustered graphsPublished by Springer Nature ,1997
- Multilevel visualization of clustered graphsPublished by Springer Nature ,1997
- Circular layout in the Graph Layout toolkitPublished by Springer Nature ,1997
- Recent directions in netlist partitioning: a surveyIntegration, 1995
- Designing graph drawings by layout graph grammarsPublished by Springer Nature ,1995
- On the complexity of H-coloringJournal of Combinatorial Theory, Series B, 1990
- On visual formalismsCommunications of the ACM, 1988