k-regular graphs with {0, 1}{0, 1}-vertex assignments and real edge functions.
Jin-Yi CaiMichael KowalczykPublished in: Theor. Comput. Sci. (2013)
Keyphrases
- undirected graph
- weighted graph
- directed graph
- vertex set
- edge weights
- edge detection
- attributed graphs
- edge information
- minimum weight
- connected subgraphs
- neural network
- minimum spanning trees
- hamiltonian cycle
- labeled graphs
- strongly connected
- bipartite graph
- real life
- random graphs
- graph clustering
- graph theory
- approximation algorithms
- graph matching
- genetic algorithm
- real world