Login / Signup

Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs.

Hanna FurmanczykMarek Kubale
Published in: Discret. Appl. Math. (2018)
Keyphrases
  • tight bounds
  • upper bound
  • worst case
  • b spline
  • graph matching
  • graph representation
  • computational complexity
  • real world
  • case study
  • computational cost
  • directed acyclic graph
  • graph databases
  • complexity analysis