On the number of minimum cuts in a graph

Local TagsRelease HistoryDetailsSummary

On the number of minimum cuts in a graph

Chandran, L. S., & Shankar Ram, L. (2004). On the number of minimum cuts in a graph. SIAM Journal on Discrete Mathematics, 18, 177-194.

Item is Released

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2AF0-4 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2AF1-2

Genre: Journal Article

show

show

hide

Creators:
Chandran, L. Sunil¹, Author
Shankar Ram, L., Author

Affiliations:
1Max Planck Society, ou_persistent13

show

show

hide

Language(s): eng - English

Dates: Modified: 2005-05-30Date issued: 2004

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 231831
Other: Local-ID: C1256BDD00205AD6-07142D03E314A0B3C1256E1C003E8CDE-DisMath2004

Degree: -

show

show

show

show

hide

Title: SIAM Journal on Discrete Mathematics

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: 18 Sequence Number: - Start / End Page: 177 - 194 Identifier: ISSN: 0895-4801