메뉴 건너뛰기




Volumn 2, Issue , 2005, Pages 1152-1155

Interconnect estimation without packing via ACG floorplans

Author keywords

[No Author keywords available]

Indexed keywords

ADJACENCY GRAPHS; ADJACENT CONSTRAINT GRAPHS; CONSTRAINT GRAPH; FLOORPLANS; INTERCONNECT ESTIMATION; SHORTEST PATH;

EID: 57849102356     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1120725.1120928     Document Type: Conference Paper
Times cited : (4)

References (14)
  • 1
    • 0141688715 scopus 로고
    • A linear algorithm to find a rectangular dual of a planar triangulated graph
    • J. Dhasker and S. Sahni. A linear algorithm to find a rectangular dual of a planar triangulated graph. In DAC, pages 108-114, 1966.
    • (1966) DAC , pp. 108-114
    • Dhasker, J.1    Sahni, S.2
  • 2
    • 0033701594 scopus 로고    scopus 로고
    • B*-treeu; A new representation for non-slicing floorplans
    • Y.-C. Chang, Y-W. Chang, G.-M. Wu, and S.-W. Wu. B*-treeu; A new representation For non-slicing floorplans. In DAC, pages 458-463, 2000
    • (2000) DAC , pp. 458-463
    • Chang, Y.-C.1    Chang, Y.-W.2    Wu, G.-M.3    Wu, S.-W.4
  • 4
    • 0032690067 scopus 로고    scopus 로고
    • An O-tree representation of non-slicing floorplan and its applications
    • P.-N. Guo, C.-K. Cheng, and T. Yoshinura. An O-tree representation of non-sliCing floorplan and its applications, In DAC, pages 268-273, 1999.
    • (1999) DAC , pp. 268-273
    • Guo, P.-N.1    Cheng, C.-K.2    Yoshinura, T.3
  • 5
    • 0034481271 scopus 로고    scopus 로고
    • Corner block liet; An effective and efficient topological representation of non-slicing floorpian
    • X. Hong, G. Huang. Y. Cai, J. Gu, S- Dong, C.-K. Cheng, and J. Gu. Corner block liet; An effective and efficient topological representation of non-slicing FloOrpian. In ICGAD, pages 8-12, 2000.
    • (2000) ICGAD , pp. 8-12
    • Hong, X.1    Huang, G.2    Cai, Y.3    Gu, J.4    Dong, S.5    Cheng, C.-K.6    Gu, J.7
  • 6
    • 0022076860 scopus 로고
    • Rectangular dual of planar graphs
    • K. Kozmmski and E. Kinnen, Rectangular dual of planar graphs. Networks 15:145-157, 1985.
    • (1985) Networks , vol.15 , pp. 145-157
    • Kozmmski, K.1    Kinnen, E.2
  • 7
    • 0024176443 scopus 로고
    • Algorithms for floor-plan design via rectangular dualization
    • Y. T. Lai and 3. M. Leinwand. Algorithms for floor-plan design via rectangular dualization. JEEE TCAD, 7( 12): 1278-1 289, 1988.
    • (1988) JEEE TCAD , vol.7 , Issue.12 , pp. 1278-1289
    • Lai, Y.T.1    Leinwand, S.M.2
  • 8
    • 0034855935 scopus 로고    scopus 로고
    • TCG' A transitive closure graph based representation for non-slicing floorplans
    • J.-M. Lin and Y.-W. Chang. TCG' A transitive closure graph based representation for non-slicing floorplans. In DAC, pages 764-769, 2001.
    • (2001) DAC , pp. 764-769
    • Lin, J.-M.1    Chang, Y.-W.2
  • 10
    • 0030408582 scopus 로고    scopus 로고
    • Module placement on BSG-stmeture and TC layout application
    • S. Nakatako, K. Fnjiyoshi, H. MutaU, and Y. Kajitani. Module placement on BSG-stmeture and TC layout application. In ICCAD, pages 484-493, 1996.
    • (1996) ICCAD , pp. 484-493
    • Nakatako, S.1    Fnjiyoshi, K.2    Mutau, H.3    Kajitani, Y.4
  • 11
    • 0033690745 scopus 로고    scopus 로고
    • What is floorplan?
    • R. H. J. M. Otten. What is floorplan? In ISPD, pages 201-206, 2000.
    • (2000) ISPD , pp. 201-206
    • Otten, R.H.J.M.1
  • 13
    • 0037387688 scopus 로고    scopus 로고
    • Twin binary sequences: A non-redundant representation for general non-Blicine iloorplan
    • April
    • P. Y. Young, C. C. N. Chu, and Z C. Shen. Twin binary sequences: A non-redundant representation for general non-Blicine iloorplan. IEF)E TCAD 22(4):457-4G9, April 2003.
    • (2003) IEEE TCAD , vol.22 , Issue.4 , pp. 457-459
    • Young, P.Y.1    Chu, C.C.N.2    Shen, Z.C.3
  • 14
    • 84861421929 scopus 로고    scopus 로고
    • A eg-adjacent constraint graph for general floorplana
    • H. Zhou and J. Wftng- A eg-adjacent constraint graph for general floorplana In ICCD, 2004.
    • (2004) ICCD
    • Zhou, H.1    Wftng, J.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.