Bandwidth of Graphs Resulting from the Edge Clique Covering Problem.
Konrad EngelSebastian HanischPublished in: Electron. J. Comb. (2018)
Keyphrases
- weighted graph
- undirected graph
- edge detection
- maximum clique
- graph matching
- graph theory
- graph structure
- graph clustering
- bandwidth allocation
- independent set
- edge information
- graph properties
- minimum spanning trees
- real time
- maximal cliques
- atm networks
- maximal clique enumeration
- network resources
- edge weights
- graph theoretic
- edge map
- spanning tree
- graph databases
- graph model
- graph mining