Stable Matching Games: Manipulation via Subgraph Isomorphism
Sign Up to like & getrecommendations! Published in 2017 at "Algorithmica"
DOI: 10.1007/s00453-017-0382-5
Abstract: In this paper we consider a problem that arises from a strategic issue in the stable matching model (with complete preference lists) from the viewpoint of exact-exponential time algorithms. Specifically, we study the Stable Extension… read more here.
Keywords: subgraph isomorphism; preference lists; time; stable matching ... See more keywords
On the Variable Ordering in Subgraph Isomorphism Algorithms
Sign Up to like & getrecommendations! Published in 2017 at "IEEE/ACM Transactions on Computational Biology and Bioinformatics"
DOI: 10.1109/tcbb.2016.2515595
Abstract: Graphs are mathematical structures to model several biological data. Applications to analyze them require to apply solutions for the subgraph isomorphism problem, which is NP-complete. Here, we investigate the existing strategies to reduce the subgraph… read more here.
Keywords: subgraph isomorphism; ordering subgraph; isomorphism algorithms; variable ordering ... See more keywords
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