An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/tcs/DahlhausK94
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/tcs/DahlhausK94
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Elias_Dahlhaus
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Marek_Karpinski
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1016%2F0304-3975%2894%2990250-X
>
foaf:
homepage
<
https://doi.org/10.1016/0304-3975(94)90250-X
>
dc:
identifier
DBLP journals/tcs/DahlhausK94
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1016%2F0304-3975%2894%2990250-X
(xsd:string)
dcterms:
issued
1994
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/tcs
>
rdfs:
label
An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Elias_Dahlhaus
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Marek_Karpinski
>
swrc:
number
2
(xsd:string)
swrc:
pages
493-528
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/tcs/DahlhausK94/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/tcs/DahlhausK94
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/tcs/tcs134.html#DahlhausK94
>
rdfs:
seeAlso
<
https://doi.org/10.1016/0304-3975(94)90250-X
>
dc:
title
An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
134
(xsd:string)