An application of graph theory in block planning
A heuristic is an algorithm that more often than not gives nearly the right answer. This study presents three heuristics that are useful in constructing a planar adjacency graph. These are the Deltahedron Heuristic, an algorithm based on Relationship Diagramming Process and a proposed heuristic by t...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
2008
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/10132 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |