Mikael Onsjö

Showing 3 publications


Graph Partitioning and Planted Partitions

Mikael Onsjö
Licentiate thesis

Finding Most Likely Solutions

Mikael Onsjö, Osamu Watanabe
Proc. CiE 2007: Computability in Europe. Vol. 4497, p. 758-767
Paper in proceedings

A Simple Message Passing Algorithm for Graph Partitioning

Mikael Onsjö, Osamu Watanabe
Algorithms and Computation 17th International Symposium, ISAAC 2006 Kolkata, India, December 18-20, 2006 Proceedings, Asano, Tetsuo (Ed.). Vol. 4288, p. 507-516
Paper in proceedings

Save references

If you have installed Zotero or Mendeley on your computer you can use a plugin to extract references from the publications you see.

Download plugins:

There are no projects.
There might be more projects where Mikael Onsjö participates, but you have to be logged in as a Chalmers employee to see them.