Maximum number of nodes using grph

51 views
Skip to first unread message

jsa...@gmail.com

unread,
Feb 29, 2016, 9:51:19 AM2/29/16
to Grph: High Performance Graph Library for Java
Hello,
I want to calculate the Maximum Common Subgraphs between two graphs but at first I want to make sure that I can use grph for really large graphs (million nodes). I am between grph and JUNG library. What do you suggest?

Thank you,
Nina

Luc Hogie

unread,
Feb 29, 2016, 10:03:39 AM2/29/16
to jsa...@gmail.com, Grph: High Performance Graph Library for Java
Dear Nina,

The Max Common Subgraph  problem is known to be NP-hard. This means that you won'tbe able to compute more that a few dozen vertices in reasonable time. Even with the fastest graph library on Earth.

This said, if you search for the fastest lib, I would say that Grph was made to be fast. It uses many technical tricks that make it an order of magnitude faster than other libs. I'm not saying that Jung is a bad lib. It has many advantages over Grph (in particular its clean OO model), but it was not designed to be computationally efficient.

Hope this helps,
Luc.


--
You received this message because you are subscribed to the Google Groups "Grph: High Performance Graph Library for Java" group.
To unsubscribe from this group and stop receiving emails from it, send an email to grph-high-performance-gr...@googlegroups.com.
To post to this group, send an email to grph-high-performa...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.



--

Luc Hogie 

Phone: 06 80 91 40 71

Skype: luchogie


"Je suis heureux parce que c'est bon pour la santé" Voltaire


jsa...@gmail.com

unread,
Feb 29, 2016, 10:17:16 AM2/29/16
to Grph: High Performance Graph Library for Java, jsa...@gmail.com
Thank you for your quick response, So my next question is if grph can calculate MCS. I know there is an other question about that but as it is old enough I am asking again.

Thanks

Luc Hogie

unread,
Feb 29, 2016, 10:23:33 AM2/29/16
to jsa...@gmail.com, Grph: High Performance Graph Library for Java
I'm sorry there is no implementation of such algorithm in Grph. However, it has subgraph matching: if you know the topology of the graph you are looking for, you can search for it in a given graph.

--
You received this message because you are subscribed to the Google Groups "Grph: High Performance Graph Library for Java" group.
To unsubscribe from this group and stop receiving emails from it, send an email to grph-high-performance-gr...@googlegroups.com.
To post to this group, send an email to grph-high-performa...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.
Reply all
Reply to author
Forward
0 new messages