The computational strength of matchings in countable graphs.
Stephen FloodMatthew JuraOscar LevinTyler MarkkanenPublished in: Ann. Pure Appl. Log. (2022)
Keyphrases
- graph matching
- maximum cardinality
- markov chain
- graph theory
- mathematical programming
- object recognition
- linear programming
- bipartite graph
- weighted graph
- databases
- search engine
- pattern recognition
- semi supervised
- genetic algorithm
- neural network
- computational models
- graph representation
- graph construction
- adjacency matrix