On linear area embedding of planar graphs:
Planar embedding with minimal area of graphs on an integer grid is one of the major issues in VLSI. Valiant (V) gave an algorithm to construct a planar embedding for trees in linear area; he also proved that there are planar graphs that require quadratic area. We give an algorithm to embed outerplan...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Stanford, Calif.
1981
|
| Series: | Stanford University / Computer Science Department: Report STAN-CS
876 |
| Subjects: | |
| Summary: | Planar embedding with minimal area of graphs on an integer grid is one of the major issues in VLSI. Valiant (V) gave an algorithm to construct a planar embedding for trees in linear area; he also proved that there are planar graphs that require quadratic area. We give an algorithm to embed outerplanar graphs in linear area. We extend this algorithm to work for every planar graph that has the following property: for every vertex there exists a path of length less than K to the exterior face, where K is a constant. Finally, finding a minimal embedding area is shown to be NP-complete for forests, and hence more general types of graphs. (Author). |
| Physical Description: | 21 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009075626 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940227s1981 |||| 00||| eng d | ||
| 035 | |a (OCoLC)227518863 | ||
| 035 | |a (DE-599)BVBBV009075626 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Dolev, Danny |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a On linear area embedding of planar graphs |c Danny Dolev ; Howard Trickey* |
| 264 | 1 | |a Stanford, Calif. |c 1981 | |
| 300 | |a 21 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Stanford University / Computer Science Department: Report STAN-CS |v 876 | |
| 520 | 3 | |a Planar embedding with minimal area of graphs on an integer grid is one of the major issues in VLSI. Valiant (V) gave an algorithm to construct a planar embedding for trees in linear area; he also proved that there are planar graphs that require quadratic area. We give an algorithm to embed outerplanar graphs in linear area. We extend this algorithm to work for every planar graph that has the following property: for every vertex there exists a path of length less than K to the exterior face, where K is a constant. Finally, finding a minimal embedding area is shown to be NP-complete for forests, and hence more general types of graphs. (Author). | |
| 650 | 4 | |a Trees(Mathematics) | |
| 650 | 4 | |a VLSI(Very Large Scale Integration) | |
| 650 | 7 | |a Algorithms |2 dtict | |
| 650 | 7 | |a Electrical and Electronic Equipment |2 scgdst | |
| 650 | 7 | |a Embedding |2 dtict | |
| 650 | 7 | |a Graphs |2 dtict | |
| 650 | 7 | |a Grids(coordinates) |2 dtict | |
| 650 | 7 | |a Integrated circuits |2 dtict | |
| 650 | 7 | |a Linear systems |2 dtict | |
| 650 | 7 | |a Microelectronics |2 dtict | |
| 650 | 7 | |a Planar structures |2 dtict | |
| 650 | 7 | |a Theorems |2 dtict | |
| 650 | 7 | |a Theoretical Mathematics |2 scgdst | |
| 700 | 1 | |a Trickey, Howard |e Verfasser |4 aut | |
| 810 | 2 | |a Computer Science Department: Report STAN-CS |t Stanford University |v 876 |w (DE-604)BV008928280 |9 876 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006012967 | ||
Record in the Search Index
| _version_ | 1804123489386364928 |
|---|---|
| any_adam_object | |
| author | Dolev, Danny Trickey, Howard |
| author_facet | Dolev, Danny Trickey, Howard |
| author_role | aut aut |
| author_sort | Dolev, Danny |
| author_variant | d d dd h t ht |
| building | Verbundindex |
| bvnumber | BV009075626 |
| ctrlnum | (OCoLC)227518863 (DE-599)BVBBV009075626 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02096nam a2200445 cb4500</leader><controlfield tag="001">BV009075626</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940227s1981 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227518863</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009075626</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Dolev, Danny</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On linear area embedding of planar graphs</subfield><subfield code="c">Danny Dolev ; Howard Trickey*</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1981</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">21 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Stanford University / Computer Science Department: Report STAN-CS</subfield><subfield code="v">876</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Planar embedding with minimal area of graphs on an integer grid is one of the major issues in VLSI. Valiant (V) gave an algorithm to construct a planar embedding for trees in linear area; he also proved that there are planar graphs that require quadratic area. We give an algorithm to embed outerplanar graphs in linear area. We extend this algorithm to work for every planar graph that has the following property: for every vertex there exists a path of length less than K to the exterior face, where K is a constant. Finally, finding a minimal embedding area is shown to be NP-complete for forests, and hence more general types of graphs. (Author).</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Trees(Mathematics)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">VLSI(Very Large Scale Integration)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithms</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Electrical and Electronic Equipment</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Embedding</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Graphs</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Grids(coordinates)</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Integrated circuits</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Linear systems</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Microelectronics</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Planar structures</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Theorems</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Theoretical Mathematics</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Trickey, Howard</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: Report STAN-CS</subfield><subfield code="t">Stanford University</subfield><subfield code="v">876</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">876</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006012967</subfield></datafield></record></collection> |
| id | DE-604.BV009075626 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:30:35Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006012967 |
| oclc_num | 227518863 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 21 S. |
| publishDate | 1981 |
| publishDateSearch | 1981 |
| publishDateSort | 1981 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN-CS |
| spelling | Dolev, Danny Verfasser aut On linear area embedding of planar graphs Danny Dolev ; Howard Trickey* Stanford, Calif. 1981 21 S. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN-CS 876 Planar embedding with minimal area of graphs on an integer grid is one of the major issues in VLSI. Valiant (V) gave an algorithm to construct a planar embedding for trees in linear area; he also proved that there are planar graphs that require quadratic area. We give an algorithm to embed outerplanar graphs in linear area. We extend this algorithm to work for every planar graph that has the following property: for every vertex there exists a path of length less than K to the exterior face, where K is a constant. Finally, finding a minimal embedding area is shown to be NP-complete for forests, and hence more general types of graphs. (Author). Trees(Mathematics) VLSI(Very Large Scale Integration) Algorithms dtict Electrical and Electronic Equipment scgdst Embedding dtict Graphs dtict Grids(coordinates) dtict Integrated circuits dtict Linear systems dtict Microelectronics dtict Planar structures dtict Theorems dtict Theoretical Mathematics scgdst Trickey, Howard Verfasser aut Computer Science Department: Report STAN-CS Stanford University 876 (DE-604)BV008928280 876 |
| spellingShingle | Dolev, Danny Trickey, Howard On linear area embedding of planar graphs Trees(Mathematics) VLSI(Very Large Scale Integration) Algorithms dtict Electrical and Electronic Equipment scgdst Embedding dtict Graphs dtict Grids(coordinates) dtict Integrated circuits dtict Linear systems dtict Microelectronics dtict Planar structures dtict Theorems dtict Theoretical Mathematics scgdst |
| title | On linear area embedding of planar graphs |
| title_auth | On linear area embedding of planar graphs |
| title_exact_search | On linear area embedding of planar graphs |
| title_full | On linear area embedding of planar graphs Danny Dolev ; Howard Trickey* |
| title_fullStr | On linear area embedding of planar graphs Danny Dolev ; Howard Trickey* |
| title_full_unstemmed | On linear area embedding of planar graphs Danny Dolev ; Howard Trickey* |
| title_short | On linear area embedding of planar graphs |
| title_sort | on linear area embedding of planar graphs |
| topic | Trees(Mathematics) VLSI(Very Large Scale Integration) Algorithms dtict Electrical and Electronic Equipment scgdst Embedding dtict Graphs dtict Grids(coordinates) dtict Integrated circuits dtict Linear systems dtict Microelectronics dtict Planar structures dtict Theorems dtict Theoretical Mathematics scgdst |
| topic_facet | Trees(Mathematics) VLSI(Very Large Scale Integration) Algorithms Electrical and Electronic Equipment Embedding Graphs Grids(coordinates) Integrated circuits Linear systems Microelectronics Planar structures Theorems Theoretical Mathematics |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT dolevdanny onlinearareaembeddingofplanargraphs AT trickeyhoward onlinearareaembeddingofplanargraphs |