[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/icpads/GuP96>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Qian-Ping_Gu>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Shietung_Peng>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2FICPADS.1996.517550>
foaf:homepage <https://doi.org/10.1109/ICPADS.1996.517550>
dc:identifier DBLP conf/icpads/GuP96 (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2FICPADS.1996.517550 (xsd:string)
dcterms:issued 1996 (xsd:gYear)
rdfs:label An efficient algorithm for set-to-set node-disjoint paths problem in hypercubes. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Qian-Ping_Gu>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Shietung_Peng>
swrc:pages 98-105 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/icpads/1996>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/icpads/GuP96/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/icpads/GuP96>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/icpads/icpads1996.html#GuP96>
rdfs:seeAlso <https://doi.org/10.1109/ICPADS.1996.517550>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/icpads>
dc:subject hypercube networks; graph theory; set-to-set node-disjoint paths; hypercubes; undirect graphs; Graph algorithms; interconnection networks; node-disjoint paths (xsd:string)
dc:title An efficient algorithm for set-to-set node-disjoint paths problem in hypercubes. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document