Login / Signup

Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs.

Matthew JohnsonBarnaby MartinSukanya PandeyDaniël PaulusmaSiani SmithErik Jan van Leeuwen
Published in: SWAT (2024)
Keyphrases
  • planar graphs
  • undirected graph
  • directed graph
  • vertex set
  • graph structure
  • binary trees
  • weighted graph
  • edge detection
  • edge weights
  • np hard
  • edge detector
  • graph matching
  • graph theory