On Enumerating Minimal Dicuts and Strongly Connected Subgraphs

Khachiyan, Leonid; Boros, Endre; Elbassioni, Khaled; Gurvich, Vladimir

doi:10.1007/s00453-007-9074-x

Local TagsRelease HistoryDetailsSummary

On Enumerating Minimal Dicuts and Strongly Connected Subgraphs

Khachiyan, L., Boros, E., Elbassioni, K., & Gurvich, V. (2008). On Enumerating Minimal Dicuts and Strongly Connected Subgraphs. Algorithmica, 50(1), 159-172. doi:10.1007/s00453-007-9074-x.

Item is Released

show all

Basic

hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-1C71-F Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0028-96A6-0

Genre: Journal Article

Files

show Files

Locators

show

Creators

hide

Creators:
Khachiyan, Leonid¹, Author
Boros, Endre¹, Author
Elbassioni, Khaled², Author
Gurvich, Vladimir¹, Author

Affiliations:
1External Organizations, ou_persistent22
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

hide

Language(s): eng - English

Dates: Modified: 2009-03-16Published Online: 2008Date issued: 2008

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 428129
DOI: 10.1007/s00453-007-9074-x
URI: http://dx.doi.org/10.1007/s00453-007-9074-x
Other: Local-ID: C125756E0038A185-E69FF15607BAFEF9C12575540038679A-Elbassioni2008n

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

hide

Title: Algorithmica

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: New York, NY : Springer

Pages: - Volume / Issue: 50 (1) Sequence Number: - Start / End Page: 159 - 172 Identifier: ISSN: 0178-4617
CoNE: https://pure.mpg.de/cone/journals/resource/954925487793