[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/vlsid/PalPP97>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Ajit_Pal>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Rajat_Kumar_Pal>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Sudebkumar_Prasant_Pal>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2FICVD.1997.568200>
foaf:homepage <https://doi.org/10.1109/ICVD.1997.568200>
dc:identifier DBLP conf/vlsid/PalPP97 (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2FICVD.1997.568200 (xsd:string)
dcterms:issued 1997 (xsd:gYear)
rdfs:label An Algorithm for Finding a Non-Trivial Lower Bound for Channel Routing. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Ajit_Pal>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Rajat_Kumar_Pal>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Sudebkumar_Prasant_Pal>
swrc:pages 531-533 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/vlsid/1997>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/vlsid/PalPP97/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/vlsid/PalPP97>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/vlsid/vlsid1997.html#PalPP97>
rdfs:seeAlso <https://doi.org/10.1109/ICVD.1997.568200>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/vlsid>
dc:subject VLSI, three-layer restricted dogleg routing model, nontrivial lower bound, channel routing problem, VLSI design, two-layer Manhattan routing model, polynomial time algorithm, three-layer no-dogleg HVH routing model, two-layer restricted dogleg routing model, vertical constraint graph (xsd:string)
dc:title An Algorithm for Finding a Non-Trivial Lower Bound for Channel Routing. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document