I need to find the maximum common edge (connected) subgraph of two input graphs.
I have implemented them in Python as follow:
I construct line graphs of two input graphs then identify the maximum clique of the modular graph of the line graphs.
The problem is that this implementation is computationally expensive.
I'm looking for a software tool in R for the MCES problem. Can you recommend me one?
Dear Hung Le
I cannot be of much help with R, but there are several Python packages that you can try. These include NetworkX ( http://networkx.github.io/ ), igraph ( https://graph-tool.skewed.de/ ), and graph-tool ( https://graph-tool.skewed.de/ ). All three libraries are under active development. igraph is available for R as well. NetworkX is best known, but I think graph-tool is faster.
I hope this helps.
All the best
Johan
- Badges
- Science topic
- Similar topics
- Mathematical Sciences
- Graphs