Finding Shortest Multi-Paths with O(N2) Message Complexity. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/conf/ISCApdcs/BreesK08>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Jerrolyn_Brees>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Sukhamay_Kundu>
dc:identifier	DBLP conf/ISCApdcs/BreesK08 (xsd:string)
dcterms:issued	2008 (xsd:gYear)
rdfs:label	Finding Shortest Multi-Paths with O(N2) Message Complexity. (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Jerrolyn_Brees>
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Sukhamay_Kundu>
swrc:pages	1-6 (xsd:string)
dcterms:partOf	<https://dblp.l3s.de/d2r/resource/publications/conf/ISCApdcs/2008>
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/conf/ISCApdcs/BreesK08/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/conf/ISCApdcs/BreesK08>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/conf/ISCApdcs/pdccs2008.html#BreesK08>
swrc:series	<https://dblp.l3s.de/d2r/resource/conferences/ISCApdcs>
dc:title	Finding Shortest Multi-Paths with O(N2) Message Complexity. (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:InProceedings
rdf:type	foaf:Document