Tight Bounds for Online Matching in Bounded-Degree Graphs with Vertex Capacities.
Susanne AlbersSebastian SchubertPublished in: ESA (2022)
Keyphrases
- tight bounds
- bounded degree
- graph matching
- maximum cardinality
- upper bound
- graph theoretic
- bipartite graph
- attributed graphs
- directed graph
- online learning
- undirected graph
- minimum weight
- matching algorithm
- bounded treewidth
- image matching
- labeled graphs
- subgraph isomorphism
- graph theory
- attributed relational graph
- graph databases
- hamiltonian cycle
- databases
- weighted graph
- lower bound
- social networks
- machine learning