Upper Bounds on the Acyclic Chromatic Index of Degenerate Graphs.
Nevil AntoManu BasavarajuSuresh Manjanath HegdeShashanka KulamarvaPublished in: CoRR (2023)
Keyphrases
- upper bound
- lower bound
- np hard
- worst case
- tight bounds
- connected graphs
- upper and lower bounds
- branch and bound
- lower and upper bounds
- graph theory
- bounded treewidth
- graph matching
- np complete
- index structure
- database
- sample complexity
- graph theoretic
- color images
- database schemes
- spanning tree
- graph representation
- linear programming
- concept classes
- subgraph isomorphism
- efficiently computable
- pruning power
- graph databases
- constant factor
- graph mining
- branch and bound algorithm
- sufficient conditions
- objective function