On the complexity of determining the irregular chromatic index of a graph.
Olivier BaudonJulien BensmailÉric SopenaPublished in: J. Discrete Algorithms (2015)
Keyphrases
- graph representation
- graph model
- computational complexity
- graph structure
- bipartite graph
- graph matching
- index structure
- query graph
- connected components
- random walk
- worst case
- color images
- structured data
- b tree
- graph theory
- weighted graph
- graph mining
- search engine
- space complexity
- graph partitioning
- databases
- database