Edge Congestion of Shortest Path Systems for All-to-All Communication.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/tpds/FiducciaH97
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/tpds/FiducciaH97
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Charles_M._Fiduccia
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Paul_J._Hedrick
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2F71.629487
>
foaf:
homepage
<
https://doi.org/10.1109/71.629487
>
dc:
identifier
DBLP journals/tpds/FiducciaH97
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2F71.629487
(xsd:string)
dcterms:
issued
1997
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/tpds
>
rdfs:
label
Edge Congestion of Shortest Path Systems for All-to-All Communication.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Charles_M._Fiduccia
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Paul_J._Hedrick
>
swrc:
number
10
(xsd:string)
swrc:
pages
1043-1054
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/tpds/FiducciaH97/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/tpds/FiducciaH97
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/tpds/tpds8.html#FiducciaH97
>
rdfs:
seeAlso
<
https://doi.org/10.1109/71.629487
>
dc:
subject
Cartesian product graphs, centroid, congestion, distance matrix, graph embedding, mapping problem, networks, oblivious routing, shortest paths.
(xsd:string)
dc:
title
Edge Congestion of Shortest Path Systems for All-to-All Communication.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
8
(xsd:string)