Solving the Maximally Balanced Connected Partition Problem in Graphs by Using Genetic Algorithm

Jozef Kratica, Dusan Tosic, Vladimir Filipovic. Solving the Maximally Balanced Connected Partition Problem in Graphs by Using Genetic Algorithm. Computers and Artificial Intelligence, 27(3):341-354, 2008. [doi]

@article{KraticaTF08,
  title = {Solving the Maximally Balanced Connected Partition Problem in Graphs by Using Genetic Algorithm},
  author = {Jozef Kratica and Dusan Tosic and Vladimir Filipovic},
  year = {2008},
  url = {http://www.sav.sk/index.php?lang=en&charset=ascii&doc=journal&part=list_articles&journal_issue_no=2120#abstract_4853},
  tags = {graph-rewriting, rewriting, partitioning},
  researchr = {https://researchr.org/publication/KraticaTF08},
  cites = {0},
  citedby = {0},
  journal = {Computers and Artificial Intelligence},
  volume = {27},
  number = {3},
  pages = {341-354},
}