Multi.Objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization

Navaratnasothie Selvakkumaran, George Karypis. Multi.Objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization. In 2003 International Conference on Computer-Aided Design (ICCAD 03), November 9-13, 2003, San Jose, CA, USA. pages 726-733, IEEE Computer Society / ACM, 2003. [doi]

@inproceedings{SelvakkumaranK03,
  title = {Multi.Objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization},
  author = {Navaratnasothie Selvakkumaran and George Karypis},
  year = {2003},
  doi = {10.1145/996070.1009968},
  url = {http://doi.acm.org/10.1145/996070.1009968},
  tags = {partitioning},
  researchr = {https://researchr.org/publication/SelvakkumaranK03},
  cites = {0},
  citedby = {0},
  pages = {726-733},
  booktitle = {2003 International Conference on Computer-Aided Design (ICCAD 03), November 9-13, 2003, San Jose, CA, USA},
  publisher = {IEEE Computer Society / ACM},
  isbn = {1-58113-762-1},
}