b-coloring of tight graphs.
Frédéric HavetCláudia Linhares SalesLeonardo Sampaio RochaPublished in: Discret. Appl. Math. (2012)
Keyphrases
- lower bound
- upper bound
- worst case
- graph theoretical
- graph theoretic
- graph matching
- graph theory
- graph structure
- series parallel
- graph clustering
- real time
- directed graph
- bipartite graph
- graph mining
- graph databases
- complex structures
- graph representation
- graph data
- multiscale
- graph kernels
- graph construction
- image segmentation
- information retrieval