On the geometric layout of graphs : complexity and approximation results
In the expanding computer science field of Graph Drawing, methods are developed to draw graphs in order to fulfill certain criteria, including minimizing the number of edges that need to be removed to make a drawing planar. The Two-Layer Planarization problem attempts to minimize this criterion f...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en |
| Published: |
McGill University
2002
|
| Subjects: | |
| Online Access: | http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=78394 |