Precomputation of Constrained Widest Paths in Communication Networks.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/networking/SiachalouG04
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/networking/SiachalouG04
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Leonidas_Georgiadis
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Stavroula_Siachalou
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F978-3-540-24693-0%5F98
>
foaf:
homepage
<
https://doi.org/10.1007/978-3-540-24693-0_98
>
dc:
identifier
DBLP conf/networking/SiachalouG04
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F978-3-540-24693-0%5F98
(xsd:string)
dcterms:
issued
2004
(xsd:gYear)
rdfs:
label
Precomputation of Constrained Widest Paths in Communication Networks.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Leonidas_Georgiadis
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Stavroula_Siachalou
>
swrc:
pages
1192-1203
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/networking/2004
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/networking/SiachalouG04/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/networking/SiachalouG04
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/networking/networking2004.html#SiachalouG04
>
rdfs:
seeAlso
<
https://doi.org/10.1007/978-3-540-24693-0_98
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/networking
>
dc:
subject
Precomputation, QoS Routing, Widest Paths, Bottleneck Paths, Graph Theory.
(xsd:string)
dc:
title
Precomputation of Constrained Widest Paths in Communication Networks.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document