Login / Signup

Decomposing 4-connected planar triangulations into two trees and one path.

Kolja KnauerTorsten Ueckerdt
Published in: J. Comb. Theory, Ser. B (2019)
Keyphrases
  • surface patches
  • decision trees
  • shortest path
  • connected components
  • root node
  • machine learning
  • data structure
  • tree structures
  • data sets
  • learning algorithm
  • ground plane
  • optimal path
  • single point
  • minimum cost path