A note on Winkler's algorithm for factoring a connected graph.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/dm/Hochstrasser92
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/dm/Hochstrasser92
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Bernhard_Hochstrasser
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1016%2F0012-365X%2892%2990283-L
>
foaf:
homepage
<
https://doi.org/10.1016/0012-365X(92)90283-L
>
dc:
identifier
DBLP journals/dm/Hochstrasser92
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1016%2F0012-365X%2892%2990283-L
(xsd:string)
dcterms:
issued
1992
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/dm
>
rdfs:
label
A note on Winkler's algorithm for factoring a connected graph.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Bernhard_Hochstrasser
>
swrc:
number
1-3
(xsd:string)
swrc:
pages
127-132
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/dm/Hochstrasser92/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/dm/Hochstrasser92
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/dm/dm109.html#Hochstrasser92
>
rdfs:
seeAlso
<
https://doi.org/10.1016/0012-365X(92)90283-L
>
dc:
title
A note on Winkler's algorithm for factoring a connected graph.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
109
(xsd:string)