Computing the bipartite edge frustration of fullerene graphs.
Tomislav DoslicDamir VukicevicPublished in: Discret. Appl. Math. (2007)
Keyphrases
- undirected graph
- bipartite graph
- vertex set
- graph model
- weighted graph
- graph partitioning
- edge weights
- spanning tree
- directed graph
- graph structure
- data mining
- graph representation
- edge information
- edge detection
- approximation algorithms
- graph mining
- graph matching
- complex networks
- neural network
- minimum cost
- probabilistic model
- pairwise
- pattern recognition
- graph theoretic
- genetic algorithm
- adjacency graph
- minimum spanning trees