On the number of small cut in a graph
type: Item
instance of: scholarly article
title: On the number of small cut in a graph
zbMATH Open document ID: 1046.68630
DOI: 10.1016/0020-0190(96)00079-8
author: David P. Williamson
author: Monika R. Henzinger
published in: Information Processing Letters
publication date: 2003-06-24T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1835241
zbMATH Keywords: undirected graph
MaRDI profile type: Publication
full work available at URL: 0020-0190(96)00079-8
OpenAlex ID: W2064211276
cites work: Q4228454
cites work: An Õ(n2) algorithm for minimum cuts
cites work: Q4525700
Recommended article: Q4808642
Recommended article: On the Number of Minimum Cuts in a Graph
Recommended article: On the number of cut-vertices in a graph
Recommended article: On bounds for the cutting number of a graph
Recommended article: Q4937814
Recommended article: On the cut dimension of a graph
Recommended article: Graphs with the smallest number of minimum cut sets
Recommended article: Q4405632
Recommended article: Q4697531
Recommended article: The minimum size of graphs satisfying cut conditions
description: scientific article; zbMATH DE number 1835241