Approximately counting independent sets in bipartite graphs via graph containers.
Matthew JenssenWill PerkinsAditya PotukuchiPublished in: CoRR (2021)
Keyphrases
- bipartite graph
- bipartite graph matching
- maximum matching
- graph model
- maximum cardinality
- edge weights
- link prediction
- graph clustering
- minimum weight
- mutual reinforcement
- maximum weight
- information retrieval
- stable set
- social networks
- link analysis
- directed acyclic graph
- graph matching
- bipartite networks
- feature space
- affinity graph
- learning algorithm