Networks

John N. Mordeson; Sunil Mathew; Davender S. Malik

doi:10.1007/978-3-319-76454-2_4

Networks

John N. Mordeson, Sunil Mathew, Davender S. Malik

Department of Mathematics

Research output: Chapter in Book/Report/Conference proceeding › Chapter

Abstract

In the first three sections, we devote our attention to the problem of maximizing the flow through a network. We present a fuzzy version of a max flow, min cut theorem.

Original language	English (US)
Title of host publication	Studies in Fuzziness and Soft Computing
Publisher	Springer Verlag
Pages	139-155
Number of pages	17
DOIs	https://doi.org/10.1007/978-3-319-76454-2_4
State	Published - 2018

Publication series

Name	Studies in Fuzziness and Soft Computing
Volume	365
ISSN (Print)	1434-9922

All Science Journal Classification (ASJC) codes

Computer Science (miscellaneous)
Computational Mathematics

Access to Document

10.1007/978-3-319-76454-2_4

Fingerprint Dive into the research topics of 'Networks'. Together they form a unique fingerprint.

Cite this

@inbook{9ff36a6420ad47b8b18f81491c0c1b8e,

title = "Networks",

abstract = "In the first three sections, we devote our attention to the problem of maximizing the flow through a network. We present a fuzzy version of a max flow, min cut theorem.",

author = "Mordeson, {John N.} and Sunil Mathew and Malik, {Davender S.}",

year = "2018",

doi = "10.1007/978-3-319-76454-2_4",

language = "English (US)",

series = "Studies in Fuzziness and Soft Computing",

publisher = "Springer Verlag",

pages = "139--155",

booktitle = "Studies in Fuzziness and Soft Computing",

address = "Germany",

}

TY - CHAP

T1 - Networks

AU - Mordeson, John N.

AU - Mathew, Sunil

AU - Malik, Davender S.

PY - 2018

Y1 - 2018

N2 - In the first three sections, we devote our attention to the problem of maximizing the flow through a network. We present a fuzzy version of a max flow, min cut theorem.

AB - In the first three sections, we devote our attention to the problem of maximizing the flow through a network. We present a fuzzy version of a max flow, min cut theorem.

UR - http://www.scopus.com/inward/record.url?scp=85044174801&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85044174801&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-76454-2_4

DO - 10.1007/978-3-319-76454-2_4

M3 - Chapter

AN - SCOPUS:85044174801

T3 - Studies in Fuzziness and Soft Computing

SP - 139

EP - 155

BT - Studies in Fuzziness and Soft Computing

PB - Springer Verlag

ER -