An efficient cut-based algorithm on minimizing the number of L-shaped channels for safe routing ordering.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/iccd/Yan95a
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/iccd/Yan95a
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Jin-Tai_Yan
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FICCD.1995.528835
>
foaf:
homepage
<
https://doi.org/10.1109/ICCD.1995.528835
>
dc:
identifier
DBLP conf/iccd/Yan95a
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FICCD.1995.528835
(xsd:string)
dcterms:
issued
1995
(xsd:gYear)
rdfs:
label
An efficient cut-based algorithm on minimizing the number of L-shaped channels for safe routing ordering.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Jin-Tai_Yan
>
swrc:
pages
366-371
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/iccd/1995
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/iccd/Yan95a/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/iccd/Yan95a
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/iccd/iccd1995.html#Yan95a
>
rdfs:
seeAlso
<
https://doi.org/10.1109/ICCD.1995.528835
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/iccd
>
dc:
subject
computational complexity; circuit layout CAD; cut-based algorithm; L-shaped channels; safe routing ordering; geometrical topology; floorplan graph; precedence relations; channel precedence graph; S-cuts; redundant L-cuts; balanced L-cuts; non-minimal L-cuts; non-critical L-cuts; critical L-cuts; time complexity; line segments
(xsd:string)
dc:
title
An efficient cut-based algorithm on minimizing the number of L-shaped channels for safe routing ordering.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document