Reconstructing a Minimum Spanning Tree after Deletion of Any Node.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/algorithmica/DasL01
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/algorithmica/DasL01
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/B._Das
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Michael_C._Loui
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2Fs00453-001-0061-3
>
foaf:
homepage
<
https://doi.org/10.1007/s00453-001-0061-3
>
dc:
identifier
DBLP journals/algorithmica/DasL01
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2Fs00453-001-0061-3
(xsd:string)
dcterms:
issued
2001
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/algorithmica
>
rdfs:
label
Reconstructing a Minimum Spanning Tree after Deletion of Any Node.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/B._Das
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Michael_C._Loui
>
swrc:
number
4
(xsd:string)
swrc:
pages
530-547
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/algorithmica/DasL01/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/algorithmica/DasL01
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica31.html#DasL01
>
rdfs:
seeAlso
<
https://doi.org/10.1007/s00453-001-0061-3
>
dc:
subject
Minimum spanning tree, Node deletion, Node replacement, CREW PRAM.
(xsd:string)
dc:
title
Reconstructing a Minimum Spanning Tree after Deletion of Any Node.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
31
(xsd:string)