[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/ispan/YangYWZ05>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Bing_Yang_0001>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Jianping_Wang_0001>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Mei_Yang>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/S._Q._Zheng_0001>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2FISPAN.2005.60>
foaf:homepage <https://doi.org/10.1109/ISPAN.2005.60>
dc:identifier DBLP conf/ispan/YangYWZ05 (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2FISPAN.2005.60 (xsd:string)
dcterms:issued 2005 (xsd:gYear)
rdfs:label Minimum Cost Paths Subject to Minimum Vulnerability for Reliable Communications. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Bing_Yang_0001>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Jianping_Wang_0001>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Mei_Yang>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/S._Q._Zheng_0001>
swrc:pages 334-339 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/ispan/2005>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/ispan/YangYWZ05/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/ispan/YangYWZ05>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/ispan/ispan2005.html#YangYWZ05>
rdfs:seeAlso <https://doi.org/10.1109/ISPAN.2005.60>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/ispan>
dc:subject Networks, graph, algorithm, protection, reliability,survivability, disjoint paths, shortest path, complexity, network flow, minimum cost network flow. (xsd:string)
dc:title Minimum Cost Paths Subject to Minimum Vulnerability for Reliable Communications. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document