StochColor: Stochastic Coloring based Graph Partitioning

Loading...

View/Download File

10-011.pdf (538.79 KB)

Persistent link to this item

https://hdl.handle.net/11299/215829

Statistics

View Statistics

Journal Title

Journal ISSN

Volume Title

Title

StochColor: Stochastic Coloring based Graph Partitioning

Authors

Pathak, Nishith

Banerjee, Arindam

Srivastava, Jaideep

Published Date

2010-04-30

Publisher

Type

Report

Abstract

Graph partitioning is a classical problem in computer science. Most algorithms consist of heuristic, spectral and stochastic flow based methods. In this paper a novel technique for graph partitioning is presented. The proposed algorithm, called StochColor extracts partitions from the most likely state of a stochastic graph coloring process. Empirical results show that StochColor is comparable to or significantly better than state of the art spectral clustering and stochastic flow based methods, across a variety of applications.

Keywords

Description

Related to

Replaces

License

Collections

Computer Science & Engineering (CS&E) Technical Reports

Series/Report Number

Technical Report; 10-011

Funding information

Isbn identifier

Doi identifier

Previously Published Citation

Suggested citation

Pathak, Nishith; Banerjee, Arindam; Srivastava, Jaideep. (2010). StochColor: Stochastic Coloring based Graph Partitioning. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215829.

Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.