Fixed parameter tractable algorithms for graph isomorphism

Asked Apr 16 '14 at 15:33

Active Apr 17 '14 at 10:21

Viewed 171 times

What are the future directions in fixed parameter tractability of graphs isomorphism after these two recent papers:

edited Apr 17 '14 at 10:21

Pål GD

asked Apr 16 '14 at 15:33

Kumar

3

Have you seen http://dl.acm.org/citation.cfm?id=802206 ? – Thomas Apr 16 '14 at 16:29
1

You seem to be asking "what topics remain in this area that people are not already working on". Given that you are linking to two very recent papers, if you find their further work sections insufficient, then you should perhaps be asking their authors? – András Salamon Apr 17 '14 at 08:27
1

possible duplicate of http://cstheory.stackexchange.com/questions/20267/open-problems-related-to-graph-isomorphism/20272 ? – frafl May 05 '14 at 15:42
@Thomas: Have you seen http://www.springerlink.com/index/RTYTQR946FW2X9JL.pdf ? – frafl May 05 '14 at 15:45

0 Answers0