The Combinatorial Nullstellensatz and DFT on Perfect Matchings in Bipartite Graphs.
Timothy M. BrauchAndré E. KézdyHunter S. SnevilyPublished in: Ars Comb. (2014)
Keyphrases
- bipartite graph
- maximum cardinality
- maximum matching
- minimum weight
- discrete fourier transform
- frequency domain
- graph model
- link prediction
- fourier transform
- graph clustering
- edge weights
- bipartite graph matching
- machine learning
- maximum weight
- endpoints
- np complete
- query processing
- bipartite networks
- decision trees
- information retrieval