Login / Signup

Color-avoiding connected spanning subgraphs with minimum number of edges.

József PintérKitti Varga
Published in: Discret. Appl. Math. (2024)
Keyphrases
  • color images
  • small number
  • data structure
  • memory requirements
  • directed acyclic graph
  • huge number
  • maximum number
  • color correction