Efficient Reassembling of Three-Regular Planar Graphs

10 Jul 2018 Assaf Kfoury Benjamin Sisson

A reassembling of a simple graph G = (V,E) is an abstraction of a problem arising in earlier studies of network analysis. There are several equivalent definitions of graph reassembling; in this report we use a definition which makes it closest to the notion of graph carving... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • DATA STRUCTURES AND ALGORITHMS
  • 68Q99, 68W40, 05C10
  • C.M; F.2; F.M