메뉴 건너뛰기





Volumn , Issue , 2008, Pages 126-133

An O(nlogn) edge-based algorithm for obstacle-avoiding rectilinear Steiner tree construction

Author keywords

Minimum terminal spanning tree; Physical design; Routing; Spanning graph; Steiner tree

Indexed keywords

MINIMUM TERMINAL SPANNING TREE; PHYSICAL DESIGN; SPANNING GRAPH; STEINER TREE;

EID: 43349093078     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1353629.1353658     Document Type: Conference Paper
Times cited : (15)

References (11)
  • Reference 정보가 존재하지 않습니다.

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