Login / Signup

Linear Algorithms for a k-partition Problem of Planar Graphs without Specifying Bases.

Koichi WadaWei Chen
Published in: WG (1998)
Keyphrases
  • planar graphs
  • computational complexity
  • optimization problems
  • upper bound