Existence and polynomial time construction of biregular, bipartite Ramanujan graphs of all degrees.
Aurelien GribinskiAdam W. MarcusPublished in: CoRR (2021)
Keyphrases
- graph model
- bipartite graph
- graph partitioning
- graph isomorphism
- undirected graph
- approximation algorithms
- conp complete
- graph representation
- real valued
- polynomial time complexity
- graph clustering
- graph matching
- directed graph
- special case
- computational complexity
- graph theory
- graph databases
- spanning tree
- np complete
- worst case
- np hard
- construction process
- bounded treewidth
- complementarity problems
- neural network