Challenging the Time Complexity of Exact Subgraph Isomorphism for Huge and Dense Graphs with VF3
Sign Up to like & getrecommendations! Published in 2018 at "IEEE Transactions on Pattern Analysis and Machine Intelligence"
DOI: 10.1109/tpami.2017.2696940
Abstract: Graph matching is essential in several fields that use structured information, such as biology, chemistry, social networks, knowledge management, document analysis and others. Except for special classes of graphs, graph matching has in the worst-case… read more here.
Keywords: graphs; complexity; time; huge dense ... See more keywords