English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  A correctness certificate for the Stoer-Wagner min-cut algorithm

Arikati, S. R., & Mehlhorn, K. (1999). A correctness certificate for the Stoer-Wagner min-cut algorithm. Information Processing Letters, 70, 251-254.

Item is

Files

show Files
hide Files
:
Mehlhorn_a_1999_a.pdf (Any fulltext), 59KB
 
File Permalink:
-
Name:
Mehlhorn_a_1999_a.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-
:
141.pdf (Any fulltext), 152KB
 
File Permalink:
-
Name:
141.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Arikati, Srinivasa Rao, Author
Mehlhorn, Kurt1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 Abstract: The Stoer–Wagner algorithm computes a minimum cut in a weighted undirected graph. The algorithm works in n−1 phases, where n is the number of nodes of G. Each phase takes time O(m+nlogn), where m is the number of edges of G, and computes a pair of vertices s and t and a minimum cut separating s and t. We show how to extend the algorithm such that each phase also computes a maximum flow from s to t. The flow is computed in O(m) additional time and certifies the cut computed in the phase.

Details

show
hide
Language(s): eng - English
 Dates: 2008-01-041999
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 344437
Other: Local-ID: C1256428004B93B8-E77DC5FAFF8CE44EC12568AB00367ABD-Arikati-Mehlhorn
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Information Processing Letters
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 70 Sequence Number: - Start / End Page: 251 - 254 Identifier: -