A Method for Solving a Bipartite-Graph Clustering Problem with Sequence Optimization

Keiu Harada, Takuya Ishioka, Ikuo Suzuki, Masashi Furukawa. A Method for Solving a Bipartite-Graph Clustering Problem with Sequence Optimization. In Seventh International Conference on Computer and Information Technology (CIT 2007), October 16-19, 2007, University of Aizu, Fukushima, Japan. pages 915-920, IEEE Computer Society, 2007. [doi]

@inproceedings{HaradaISF07,
  title = {A Method for Solving a Bipartite-Graph Clustering Problem with Sequence Optimization},
  author = {Keiu Harada and Takuya Ishioka and Ikuo Suzuki and Masashi Furukawa},
  year = {2007},
  doi = {10.1109/CIT.2007.1},
  url = {http://doi.ieeecomputersociety.org/10.1109/CIT.2007.1},
  tags = {optimization, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/HaradaISF07},
  cites = {0},
  citedby = {0},
  pages = {915-920},
  booktitle = {Seventh International Conference on Computer and Information Technology (CIT 2007), October 16-19, 2007, University of Aizu, Fukushima, Japan},
  publisher = {IEEE Computer Society},
  isbn = {978-0-7695-2983-7},
}