Heuristic Programming and the Minimal Crossing Problem

Author

• Vincent J. Grosso

Author Type

Graduate Student

Date of Award

1970

Document Type

Thesis

Publication Status

Version of Record

Submission Date

October 2026

Thesis/Dissertation Advisor [Chair]

Hadlock, Frank O.

Abstract

There are several theorems which give the upper bounds on the number of crossings of a graph in a plane. In this thesis we shall program certain heuristic procedures for finding the layout of the graph with the fewest number of crossings. We will then examine the output of these procedures to see if they always give us a graph with the fewest number of crossings.

Extent

41 p.

Comments

Thesis (M.S.)--Florida Atlantic University, 1970.|Thesis (M.S.)--Florida Atlantic University, 1970.

Recommended Citation

Grosso, Vincent J., "Heuristic Programming and the Minimal Crossing Problem" (1970). Electronic Theses and Dissertations 1970 - 1979. 18.
https://digitalcommons.fau.edu/etd_general_2/18

Identifier

FA00000765

Format

pdf