Perfect matching in bipartite hypergraphs subject to a demand graph.
Lior AronshtamHagai IlaniElad ShufanPublished in: Ann. Oper. Res. (2023)
Keyphrases
- bipartite graph
- maximum matching
- graph model
- maximum cardinality
- graph theory
- graph matching
- graph partitioning
- maximum weight
- undirected graph
- graph theoretic
- adjacency matrix
- hypergraph model
- vertex set
- matching algorithm
- random walk
- association graph
- pattern matching
- graph representation
- matching process
- graph mining
- subgraph isomorphism
- minimum weight
- graph structure
- spanning tree
- minimal spanning tree
- directed graph
- keypoints
- feature points
- social networks
- similarity measure
- higher order relations
- directed acyclic graph
- weighted graph
- link prediction
- real valued
- structured data
- bayesian networks