You are here
Heuristic Programming and the Minimal Crossing Problem
| Title: | Heuristic Programming and the Minimal Crossing Problem. |
 63 views 8 downloads |
|---|---|---|
| Name(s): |
Grosso, Vincent J., author Hadlock, Frank O., Thesis advisor Florida Atlantic University, Degree grantor |
|
| Type of Resource: | text | |
| Genre: | Electronic Thesis Or Dissertation | |
| Date Created: | 1970 | |
| Date Issued: | 1970 | |
| Publisher: | Florida Atlantic University | |
| Place of Publication: | Boca Raton, Fla. | |
| Physical Form: | application/pdf | |
| Extent: | 41 p. | |
| Language(s): | English | |
| Summary: | 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. | |
| Identifier: | FA00000765 (IID) | |
| Note(s): | Thesis (M.S.)--Florida Atlantic University, 1970. | |
| Subject(s): |
Graphic methods--Computer programs IBM 360 (Computer) |
|
| Held by: | Florida Atlantic University Libraries | |
| Sublocation: | Digital Library | |
| Persistent Link to This Record: | http://purl.flvc.org/fau/fd/FA00000765 | |
| Restrictions on Access: | All rights reserved by the source institution | |
| Restrictions on Access: | Copyright © is held by the author with permission granted to Florida Atlantic University to digitize, archive and distribute this item for non-profit research and educational purposes. Any reuse of this item in excess of fair use or other copyright exemptions requires permission of the copyright holder. | |
| Restrictions on Access: | http://rightsstatements.org/vocab/InC/1.0/ | |
| Host Institution: | FAU | |
| Is Part of Series: | Florida Atlantic University Digital Library Collections. |
