A Simple Systolic Method to Find all Bridges of an Undirected Graph.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/wg/SchimmlerS88
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/wg/SchimmlerS88
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Heiko_Schr%E2%88%9A%E2%88%82der_0001
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Manfred_Schimmler
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F3-540-50728-0%5F49
>
foaf:
homepage
<
https://doi.org/10.1007/3-540-50728-0_49
>
dc:
identifier
DBLP conf/wg/SchimmlerS88
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F3-540-50728-0%5F49
(xsd:string)
dcterms:
issued
1988
(xsd:gYear)
rdfs:
label
A Simple Systolic Method to Find all Bridges of an Undirected Graph.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Heiko_Schr%E2%88%9A%E2%88%82der_0001
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Manfred_Schimmler
>
swrc:
pages
262-267
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/wg/1988
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/wg/SchimmlerS88/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/wg/SchimmlerS88
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/wg/wg88.html#SchimmlerS88
>
rdfs:
seeAlso
<
https://doi.org/10.1007/3-540-50728-0_49
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/wg
>
dc:
subject
mesh-connected processor array; systolic algorithm; bridges in graphs; transitive closure; complexity
(xsd:string)
dc:
title
A Simple Systolic Method to Find all Bridges of an Undirected Graph.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document