An Algorithm to Eliminate All Complex Triangles in a Maximal Planar Graph for Use in VLSI floorplan.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/books/ws/93/TsukiyamaKS93
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/books/ws/93/TsukiyamaKS93
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Isao_Shirakawa
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Keiichi_Koike
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Shuji_Tsukiyama
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1142%2F9789812794468%5F0011
>
foaf:
homepage
<
https://doi.org/10.1142/9789812794468_0011
>
dc:
identifier
DBLP books/ws/93/TsukiyamaKS93
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1142%2F9789812794468%5F0011
(xsd:string)
dcterms:
issued
1993
(xsd:gYear)
rdfs:
label
An Algorithm to Eliminate All Complex Triangles in a Maximal Planar Graph for Use in VLSI floorplan.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Isao_Shirakawa
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Keiichi_Koike
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Shuji_Tsukiyama
>
swrc:
pages
321-335
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/books/ws/93/SL1993
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/books/ws/93/TsukiyamaKS93/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/books/ws/93/TsukiyamaKS93
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/books/collections/SL1993.html#TsukiyamaKS93
>
rdfs:
seeAlso
<
https://doi.org/10.1142/9789812794468_0011
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/collections/ws/93
>
dc:
title
An Algorithm to Eliminate All Complex Triangles in a Maximal Planar Graph for Use in VLSI floorplan.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InCollection
rdf:
type
foaf:Document