Sliceable floorplanning by graph dualization
Previous algorithms on rectangular dual graph floorplanning generate general floor-plans which include the class of nonsliceable floorplans. We examine the framework of generating sliceable floorplans using the rectangular dual graph approach and present an algorithm that generates a sliceable floor...
Gespeichert in:
| Veröffentlicht in: | SIAM journal on discrete mathematics 1995-05, Vol.8 (2), p.258-280 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 280 |
|---|---|
| container_issue | 2 |
| container_start_page | 258 |
| container_title | SIAM journal on discrete mathematics |
| container_volume | 8 |
| creator | YEAP, G. K. H MAJID SARRAFZADEH |
| description | Previous algorithms on rectangular dual graph floorplanning generate general floor-plans which include the class of nonsliceable floorplans. We examine the framework of generating sliceable floorplans using the rectangular dual graph approach and present an algorithm that generates a sliceable floorplan if the input graph satisfies certain sufficient conditions. For general input, the algorithm is still able to generate sliceable floorplans by introducing pseudomodules where the areas occupied by the pseudomodules are used for wiring. For an $n$-vertex adjacency graph, the algorithm generates a sliceable floorplan in $O( n\log n + hn )$ time where $h$ is the height of the sliceable floorplan tree. |
| doi_str_mv | 10.1137/S0895480191266700 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_925616589</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2599314601</sourcerecordid><originalsourceid>FETCH-LOGICAL-c231t-4d9bf859a0a99b91adee4c929a16eeb4575b0497e43860a271e8ddbdf1c865083</originalsourceid><addsrcrecordid>eNplkMtOwzAURC0EEuXxAewixJKAr-PXXaKKl1SJRWEdXTtOSWWSYLeL8vW0asWG1Sxmzow0jF0BvwOozP2cW1TSckAQWhvOj9gEOKrSgNTHbLKzy51_ys5yXnIOUoKasNt57HwgF0PRxmFIY6S-7_pF4TbFItH4WTRrit0Prbqhv2AnLcUcLg96zj6eHt-nL-Xs7fl1-jArvahgVcoGXWsVEidEh0BNCNKjQAIdgpPKKMclmiArqzkJA8E2jWta8FYrbqtzdr3vHdPwvQ55VS-Hdeq3kzUKpUEri9sQ7EM-DTmn0NZj6r4obWrg9e6T-t8nW-bmUEzZU2wT9b7Lf2ClpDBWVL_Aj1-h</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>925616589</pqid></control><display><type>article</type><title>Sliceable floorplanning by graph dualization</title><source>LOCUS - SIAM's Online Journal Archive</source><creator>YEAP, G. K. H ; MAJID SARRAFZADEH</creator><creatorcontrib>YEAP, G. K. H ; MAJID SARRAFZADEH</creatorcontrib><description>Previous algorithms on rectangular dual graph floorplanning generate general floor-plans which include the class of nonsliceable floorplans. We examine the framework of generating sliceable floorplans using the rectangular dual graph approach and present an algorithm that generates a sliceable floorplan if the input graph satisfies certain sufficient conditions. For general input, the algorithm is still able to generate sliceable floorplans by introducing pseudomodules where the areas occupied by the pseudomodules are used for wiring. For an $n$-vertex adjacency graph, the algorithm generates a sliceable floorplan in $O( n\log n + hn )$ time where $h$ is the height of the sliceable floorplan tree.</description><identifier>ISSN: 0895-4801</identifier><identifier>EISSN: 1095-7146</identifier><identifier>DOI: 10.1137/S0895480191266700</identifier><identifier>CODEN: SJDMEC</identifier><language>eng</language><publisher>Philadelphia, PA: Society for Industrial and Applied Mathematics</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Algorithms ; Applied sciences ; Combinatorics ; Combinatorics. Ordered structures ; Computer science; control theory; systems ; Exact sciences and technology ; Graph theory ; Graphs ; Information retrieval. Graph ; Mathematics ; Sciences and techniques of general use ; Theoretical computing</subject><ispartof>SIAM journal on discrete mathematics, 1995-05, Vol.8 (2), p.258-280</ispartof><rights>1995 INIST-CNRS</rights><rights>[Copyright] © 1995 © Society for Industrial and Applied Mathematics</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c231t-4d9bf859a0a99b91adee4c929a16eeb4575b0497e43860a271e8ddbdf1c865083</citedby><cites>FETCH-LOGICAL-c231t-4d9bf859a0a99b91adee4c929a16eeb4575b0497e43860a271e8ddbdf1c865083</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,3185,27924,27925</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=3542782$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>YEAP, G. K. H</creatorcontrib><creatorcontrib>MAJID SARRAFZADEH</creatorcontrib><title>Sliceable floorplanning by graph dualization</title><title>SIAM journal on discrete mathematics</title><description>Previous algorithms on rectangular dual graph floorplanning generate general floor-plans which include the class of nonsliceable floorplans. We examine the framework of generating sliceable floorplans using the rectangular dual graph approach and present an algorithm that generates a sliceable floorplan if the input graph satisfies certain sufficient conditions. For general input, the algorithm is still able to generate sliceable floorplans by introducing pseudomodules where the areas occupied by the pseudomodules are used for wiring. For an $n$-vertex adjacency graph, the algorithm generates a sliceable floorplan in $O( n\log n + hn )$ time where $h$ is the height of the sliceable floorplan tree.</description><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Combinatorics</subject><subject>Combinatorics. Ordered structures</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Graph theory</subject><subject>Graphs</subject><subject>Information retrieval. Graph</subject><subject>Mathematics</subject><subject>Sciences and techniques of general use</subject><subject>Theoretical computing</subject><issn>0895-4801</issn><issn>1095-7146</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1995</creationdate><recordtype>article</recordtype><sourceid>8G5</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><sourceid>GUQSH</sourceid><sourceid>M2O</sourceid><recordid>eNplkMtOwzAURC0EEuXxAewixJKAr-PXXaKKl1SJRWEdXTtOSWWSYLeL8vW0asWG1Sxmzow0jF0BvwOozP2cW1TSckAQWhvOj9gEOKrSgNTHbLKzy51_ys5yXnIOUoKasNt57HwgF0PRxmFIY6S-7_pF4TbFItH4WTRrit0Prbqhv2AnLcUcLg96zj6eHt-nL-Xs7fl1-jArvahgVcoGXWsVEidEh0BNCNKjQAIdgpPKKMclmiArqzkJA8E2jWta8FYrbqtzdr3vHdPwvQ55VS-Hdeq3kzUKpUEri9sQ7EM-DTmn0NZj6r4obWrg9e6T-t8nW-bmUEzZU2wT9b7Lf2ClpDBWVL_Aj1-h</recordid><startdate>19950501</startdate><enddate>19950501</enddate><creator>YEAP, G. K. H</creator><creator>MAJID SARRAFZADEH</creator><general>Society for Industrial and Applied Mathematics</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7WY</scope><scope>7WZ</scope><scope>7X2</scope><scope>7XB</scope><scope>87Z</scope><scope>88A</scope><scope>88F</scope><scope>88I</scope><scope>88K</scope><scope>8AL</scope><scope>8FE</scope><scope>8FG</scope><scope>8FH</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>ATCPS</scope><scope>AZQEC</scope><scope>BBNVY</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>BHPHI</scope><scope>CCPQU</scope><scope>D1I</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>KB.</scope><scope>L.-</scope><scope>L6V</scope><scope>LK8</scope><scope>M0C</scope><scope>M0K</scope><scope>M0N</scope><scope>M1Q</scope><scope>M2O</scope><scope>M2P</scope><scope>M2T</scope><scope>M7P</scope><scope>M7S</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PATMY</scope><scope>PDBOC</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>PYCSY</scope><scope>Q9U</scope></search><sort><creationdate>19950501</creationdate><title>Sliceable floorplanning by graph dualization</title><author>YEAP, G. K. H ; MAJID SARRAFZADEH</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c231t-4d9bf859a0a99b91adee4c929a16eeb4575b0497e43860a271e8ddbdf1c865083</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1995</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Combinatorics</topic><topic>Combinatorics. Ordered structures</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Graph theory</topic><topic>Graphs</topic><topic>Information retrieval. Graph</topic><topic>Mathematics</topic><topic>Sciences and techniques of general use</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>YEAP, G. K. H</creatorcontrib><creatorcontrib>MAJID SARRAFZADEH</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Access via ABI/INFORM (ProQuest)</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>Agricultural Science Collection</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Biology Database (Alumni Edition)</collection><collection>Military Database (Alumni Edition)</collection><collection>Science Database (Alumni Edition)</collection><collection>Telecommunications (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Natural Science Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (Alumni Edition)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>Agricultural & Environmental Science Collection</collection><collection>ProQuest Central Essentials</collection><collection>Biological Science Collection</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>Natural Science Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Materials Science Collection</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>Materials Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>ProQuest Biological Science Collection</collection><collection>ABI/INFORM Global</collection><collection>Agricultural Science Database</collection><collection>Computing Database</collection><collection>Military Database</collection><collection>Research Library</collection><collection>Science Database</collection><collection>Telecommunications Database</collection><collection>Biological Science Database</collection><collection>Engineering Database</collection><collection>Research Library (Corporate)</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>Environmental Science Database</collection><collection>Materials Science Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>Environmental Science Collection</collection><collection>ProQuest Central Basic</collection><jtitle>SIAM journal on discrete mathematics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>YEAP, G. K. H</au><au>MAJID SARRAFZADEH</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Sliceable floorplanning by graph dualization</atitle><jtitle>SIAM journal on discrete mathematics</jtitle><date>1995-05-01</date><risdate>1995</risdate><volume>8</volume><issue>2</issue><spage>258</spage><epage>280</epage><pages>258-280</pages><issn>0895-4801</issn><eissn>1095-7146</eissn><coden>SJDMEC</coden><abstract>Previous algorithms on rectangular dual graph floorplanning generate general floor-plans which include the class of nonsliceable floorplans. We examine the framework of generating sliceable floorplans using the rectangular dual graph approach and present an algorithm that generates a sliceable floorplan if the input graph satisfies certain sufficient conditions. For general input, the algorithm is still able to generate sliceable floorplans by introducing pseudomodules where the areas occupied by the pseudomodules are used for wiring. For an $n$-vertex adjacency graph, the algorithm generates a sliceable floorplan in $O( n\log n + hn )$ time where $h$ is the height of the sliceable floorplan tree.</abstract><cop>Philadelphia, PA</cop><pub>Society for Industrial and Applied Mathematics</pub><doi>10.1137/S0895480191266700</doi><tpages>23</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0895-4801 |
| ispartof | SIAM journal on discrete mathematics, 1995-05, Vol.8 (2), p.258-280 |
| issn | 0895-4801 1095-7146 |
| language | eng |
| recordid | cdi_proquest_journals_925616589 |
| source | LOCUS - SIAM's Online Journal Archive |
| subjects | Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Combinatorics Combinatorics. Ordered structures Computer science control theory systems Exact sciences and technology Graph theory Graphs Information retrieval. Graph Mathematics Sciences and techniques of general use Theoretical computing |
| title | Sliceable floorplanning by graph dualization |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T11%3A58%3A41IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Sliceable%20floorplanning%20by%20graph%20dualization&rft.jtitle=SIAM%20journal%20on%20discrete%20mathematics&rft.au=YEAP,%20G.%20K.%20H&rft.date=1995-05-01&rft.volume=8&rft.issue=2&rft.spage=258&rft.epage=280&rft.pages=258-280&rft.issn=0895-4801&rft.eissn=1095-7146&rft.coden=SJDMEC&rft_id=info:doi/10.1137/S0895480191266700&rft_dat=%3Cproquest_cross%3E2599314601%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=925616589&rft_id=info:pmid/&rfr_iscdi=true |