[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/tc/Vijayan91>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Gopalakrishnan_Vijayan>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2F12.76407>
foaf:homepage <https://doi.org/10.1109/12.76407>
dc:identifier DBLP journals/tc/Vijayan91 (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2F12.76407 (xsd:string)
dcterms:issued 1991 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/tc>
rdfs:label Generalization of Min-Cut Partitioning to Tree Structures and Its Applications. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Gopalakrishnan_Vijayan>
swrc:number 3 (xsd:string)
swrc:pages 307-314 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/tc/Vijayan91/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/tc/Vijayan91>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/tc/tc40.html#Vijayan91>
rdfs:seeAlso <https://doi.org/10.1109/12.76407>
dc:subject minimisation; min-cut partitioning; tree structures; nodes; hypergraph; vertices; cost function; routing; hyperedges; VLSI design applications; iterative improvement heuristic; pins; computational complexity; data structures; minimisation; trees (mathematics). (xsd:string)
dc:title Generalization of Min-Cut Partitioning to Tree Structures and Its Applications. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 40 (xsd:string)