On the number of minimum cuts in a graph
- Author
- SUNIL CHANDRAN, L1 ; SHANKAR RAM, L2
[1] Max-Planck Institute for Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken, Germany
[2] Department of Computer Science, Swiss Federal Institute of Technology, Haldeneggsteig 4, 8092, Züricìh, Switzerland - Source
SIAM journal on discrete mathematics (Print). 2005, Vol 18, Num 1, pp 177-194, 18 p ; ref : 31 ref
- CODEN
- SJDMEC
- ISSN
- 0895-4801
- Scientific domain
- Control theory, operational research; Computer science; Mathematics
- Publisher
- Society for Industrial and Applied Mathematics, Philadelphia, PA
- Publication country
- United States
- Document type
- Article
- Language
- English
- Author keyword
- 05C99 circular partition 05C35 minimum cuts
- Keyword (fr)
- Borne supérieure Coupe graphe Graphe pondéré Mathématiques discrètes 68R10 Partition circulaire
- Keyword (en)
- Upper bound Graph cut Weighted graph Discrete mathematics Circular partition
- Keyword (es)
- Cota superior Corte grafo Grafo pondero Matemáticas discretas
- Classification
- Pascal
- 001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02B Combinatorics. Ordered structures / 001A02B01 Combinatorics / 001A02B01C Graph theory
- Discipline
- Mathematics
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 16597353
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1137/S0895480103427138 
https://dx.doi.org/10.1137/S0895480103427138
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1137\/S0895480103427138\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:40:\"On the number of minimum cuts in a graph\";s:9:\"\u0000*\u0000jtitle\";s:44:\"SIAM journal on discrete mathematics (Print)\";s:9:\"\u0000*\u0000stitle\";s:30:\"SIAM j. discrete math. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"2005\";s:9:\"\u0000*\u0000volume\";s:2:\"18\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:3:\"177\";s:8:\"\u0000*\u0000epage\";s:3:\"194\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0895-4801\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:14:\"SUNIL CHANDRAN\";s:10:\"\u0000*\u0000aufirst\";s:1:\"L\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:14:\"SHANKAR RAM, L\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"SJDMEC\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:40:\"On the number of minimum cuts in a graph\";s:8:\"\u0000*\u0000place\";s:16:\"Philadelphia, PA\";s:6:\"\u0000*\u0000pub\";s:46:\"Society for Industrial and Applied Mathematics\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"18\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1137\/S0895480103427138\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:40:\"On the number of minimum cuts in a graph\";s:9:\"\u0000*\u0000jtitle\";s:44:\"SIAM journal on discrete mathematics (Print)\";s:9:\"\u0000*\u0000stitle\";s:30:\"SIAM j. discrete math. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"2005\";s:9:\"\u0000*\u0000volume\";s:2:\"18\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:3:\"177\";s:8:\"\u0000*\u0000epage\";s:3:\"194\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0895-4801\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:14:\"SUNIL CHANDRAN\";s:10:\"\u0000*\u0000aufirst\";s:1:\"L\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:14:\"SHANKAR RAM, L\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"SJDMEC\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:40:\"On the number of minimum cuts in a graph\";s:8:\"\u0000*\u0000place\";s:16:\"Philadelphia, PA\";s:6:\"\u0000*\u0000pub\";s:46:\"Society for Industrial and Applied Mathematics\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"18\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:25:\"10.1137\/S0895480103427138\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1137\/S0895480103427138\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:40:\"On the number of minimum cuts in a graph\";s:9:\"\u0000*\u0000jtitle\";s:44:\"SIAM journal on discrete mathematics (Print)\";s:9:\"\u0000*\u0000stitle\";s:30:\"SIAM j. discrete math. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"2005\";s:9:\"\u0000*\u0000volume\";s:2:\"18\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:3:\"177\";s:8:\"\u0000*\u0000epage\";s:3:\"194\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0895-4801\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:14:\"SUNIL CHANDRAN\";s:10:\"\u0000*\u0000aufirst\";s:1:\"L\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:14:\"SHANKAR RAM, L\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"SJDMEC\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:40:\"On the number of minimum cuts in a graph\";s:8:\"\u0000*\u0000place\";s:16:\"Philadelphia, PA\";s:6:\"\u0000*\u0000pub\";s:46:\"Society for Industrial and Applied Mathematics\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"18\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1137\/S0895480103427138\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:40:\"On the number of minimum cuts in a graph\";s:9:\"\u0000*\u0000jtitle\";s:44:\"SIAM journal on discrete mathematics (Print)\";s:9:\"\u0000*\u0000stitle\";s:30:\"SIAM j. discrete math. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"2005\";s:9:\"\u0000*\u0000volume\";s:2:\"18\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:3:\"177\";s:8:\"\u0000*\u0000epage\";s:3:\"194\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0895-4801\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:14:\"SUNIL CHANDRAN\";s:10:\"\u0000*\u0000aufirst\";s:1:\"L\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:14:\"SHANKAR RAM, L\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"SJDMEC\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:40:\"On the number of minimum cuts in a graph\";s:8:\"\u0000*\u0000place\";s:16:\"Philadelphia, PA\";s:6:\"\u0000*\u0000pub\";s:46:\"Society for Industrial and Applied Mathematics\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"18\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1137\/S0895480103427138\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:40:\"On the number of minimum cuts in a graph\";s:9:\"\u0000*\u0000jtitle\";s:44:\"SIAM journal on discrete mathematics (Print)\";s:9:\"\u0000*\u0000stitle\";s:30:\"SIAM j. discrete math. (Print)\";s:7:\"\u0000*\u0000date\";s:4:\"2005\";s:9:\"\u0000*\u0000volume\";s:2:\"18\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:3:\"177\";s:8:\"\u0000*\u0000epage\";s:3:\"194\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0895-4801\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:14:\"SUNIL CHANDRAN\";s:10:\"\u0000*\u0000aufirst\";s:1:\"L\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:14:\"SHANKAR RAM, L\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"SJDMEC\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:40:\"On the number of minimum cuts in a graph\";s:8:\"\u0000*\u0000place\";s:16:\"Philadelphia, PA\";s:6:\"\u0000*\u0000pub\";s:46:\"Society for Industrial and Applied Mathematics\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"18\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
