A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/siamcomp/Shamir79
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/siamcomp/Shamir79
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Adi_Shamir
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1137%2F0208051
>
foaf:
homepage
<
https://doi.org/10.1137/0208051
>
dc:
identifier
DBLP journals/siamcomp/Shamir79
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1137%2F0208051
(xsd:string)
dcterms:
issued
1979
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/siamcomp
>
rdfs:
label
A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Adi_Shamir
>
swrc:
number
4
(xsd:string)
swrc:
pages
645-655
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/siamcomp/Shamir79/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/siamcomp/Shamir79
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/siamcomp/siamcomp8.html#Shamir79
>
rdfs:
seeAlso
<
https://doi.org/10.1137/0208051
>
dc:
title
A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
8
(xsd:string)