How to Cut All Edges of a Polytope.

Abstract

A survey of mutually related problems, conjectures and results is presented, dealing with variants of the notion of the cut-number m(P) of a polytope P . Here m(P) is the least number of hyperplanes needed to intersect all edges of the polytopes P . Cut-numbers and similar notions are of interest in many contexts, ranging from pattern recognition through graph theory to functional analysis. (Author)

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1972
Accession Number
AD0741694

Entities

People

  • Branko Gruenbaum

Organizations

  • University of Washington

Tags

DTIC Thesaurus Topics

  • Functional Analysis
  • Graph Theory
  • Identification
  • Mathematics
  • Pattern Recognition
  • Recognition

Readers

  • Graph Algorithms and Convex Optimization.

Technology Areas

  • AI & ML
  • AI & ML - Machine Learning Algorithms