[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/ton/XuCXQH06>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Chunming_Qiao>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Dahai_Xu>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Xin_He>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Yang_Chen>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Yizhi_Xiong>
foaf:homepage <http://doi.acm.org/10.1145/1133553.1133565>
foaf:homepage <http://dx.doi.org/10.1145%2F1133553.1133565>
dc:identifier DBLP journals/ton/XuCXQH06 (xsd:string)
dc:identifier DOI 10.1145%2F1133553.1133565 (xsd:string)
dcterms:issued 2006 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/ton>
rdfs:label On the complexity of and algorithms for finding the shortest path with a disjoint counterpart. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Chunming_Qiao>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Dahai_Xu>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Xin_He>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Yang_Chen>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Yizhi_Xiong>
swrc:number 1 (xsd:string)
swrc:pages 147-158 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/ton/XuCXQH06/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/ton/XuCXQH06>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/ton/ton14.html#XuCXQH06>
rdfs:seeAlso <http://doi.acm.org/10.1145/1133553.1133565>
dc:subject bandwidth sharing, dynamic provisioning, graph theory, optimization, protection, survivability (xsd:string)
dc:title On the complexity of and algorithms for finding the shortest path with a disjoint counterpart. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 14 (xsd:string)