Tight Bounds for Online Matching in Bounded-Degree Graphs with Vertex Capacities.
Susanne AlbersSebastian SchubertPublished in: CoRR (2022)
Keyphrases
- tight bounds
- bounded degree
- maximum cardinality
- graph matching
- upper bound
- graph theoretic
- bipartite graph
- online learning
- attributed graphs
- matching algorithm
- directed graph
- minimum weight
- graph theory
- bounded treewidth
- edge weights
- undirected graph
- social network analysis
- vertex set
- labeled graphs
- hamiltonian cycle
- graph mining
- databases
- weighted graph
- shortest path
- learning algorithm