Note
Thesis (M.S.)--Florida Atlantic University, 1970.
Member of
Contributors
Publisher
Florida Atlantic University
Date Issued
1970
EDTF Date Created
1970
Description
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.
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.
Language
Type
Form
Extent
41 p.
Subject (Topical)
Identifier
FA00000765
Additional Information
Thesis (M.S.)--Florida Atlantic University, 1970.
Date Backup
1970
Date Created Backup
1970
Date Text
1970
Date Created (EDTF)
1970
Date Issued (EDTF)
1970
Extension
FAU
IID
FA00000765
Organizations
Attributed name: Florida Atlantic University
Person Preferred Name
Grosso, Vincent J.
author
Graduate College
Physical Description
application/pdf
41 p.
Title Plain
Heuristic Programming and the Minimal Crossing Problem
Use and Reproduction
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.
http://rightsstatements.org/vocab/InC/1.0/
Origin Information
1970
1970
Florida Atlantic University
Boca Raton, Fla.
Physical Location
Florida Atlantic University Libraries
Place
Boca Raton, Fla.
Sub Location
Digital Library
Title
Heuristic Programming and the Minimal Crossing Problem
Other Title Info
Heuristic Programming and the Minimal Crossing Problem