Bounds on the k-independence and k-chromatic numbers of graphs.
Mostafa BlidiaAhmed BouchouLutz VolkmannPublished in: Ars Comb. (2014)
Keyphrases
- upper bound
- lower bound
- color images
- graph mining
- upper and lower bounds
- directed graph
- graph representation
- confidence bounds
- graph matching
- graph theory
- neural network
- graph databases
- complex structures
- average case
- random graphs
- bipartite graph
- human perception
- conditional independence
- worst case
- real numbers
- series parallel