Advertisement

Discretizability

  • Leo LibertiEmail author
  • Carlile Lavor
Chapter
Part of the Springer Undergraduate Texts in Mathematics and Technology book series (SUMAT)

Abstract

We remarked in Sect.  2.5.1 that direct methods, which search for solutions in the continuous space \(\mathbbm {R}^{Kn}\) of all realizations, do not always work all that well. In Chap.  3, we discussed a discrete method for realizing complete graphs in polytime. In this chapter, we look at larger classes of graphs for which the search space can be shown to be discrete.

Copyright information

© Springer International Publishing Switzerland 2017

Authors and Affiliations

  1. 1.CNRS LIXÉcole PolytechniquePalaiseauFrance
  2. 2.Department of Applied Mathematics, IMECC-UNICAMPUniversity of CampinasCampinasBrazil

Personalised recommendations