GA for straight-line grid drawings of maximal planar graphs
A straight-line grid drawing of a planar graph G of n vertices is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straight-line segment without edge crossings. Finding algorithms for straight-line grid drawings of maximal planar graphs (MP...
שמור ב:
| מחבר ראשי: | |
|---|---|
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
Elsevier
2012-03-01
|
| סדרה: | Egyptian Informatics Journal |
| נושאים: | |
| גישה מקוונת: | http://www.sciencedirect.com/science/article/pii/S1110866512000047 |
| תגים: |
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|