A New Approach to the Minimum Cut Problem. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/journals/jacm/KargerS96>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Clifford_Stein_0001>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/David_R._Karger>
foaf:homepage	<http://dx.doi.org/doi.org%2F10.1145%2F234533.234534>
foaf:homepage	<https://doi.org/10.1145/234533.234534>
dc:identifier	DBLP journals/jacm/KargerS96 (xsd:string)
dc:identifier	DOI doi.org%2F10.1145%2F234533.234534 (xsd:string)
dcterms:issued	1996 (xsd:gYear)
swrc:journal	<https://dblp.l3s.de/d2r/resource/journals/jacm>
rdfs:label	A New Approach to the Minimum Cut Problem. (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Clifford_Stein_0001>
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/David_R._Karger>
swrc:number	4 (xsd:string)
swrc:pages	601-640 (xsd:string)
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/journals/jacm/KargerS96/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/journals/jacm/KargerS96>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/journals/jacm/jacm43.html#KargerS96>
rdfs:seeAlso	<https://doi.org/10.1145/234533.234534>
dc:subject	graph algorithm, minimum cut, network reliability, parallel computing, randomized algorithm (xsd:string)
dc:title	A New Approach to the Minimum Cut Problem. (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:Article
rdf:type	foaf:Document
swrc:volume	43 (xsd:string)