Mixing
how to formulate and prove networking problem
$begingroup$
Formulate and prove a theorem that gives necessary and sufficient conditions so that a network with multiple sources and sinks has a flow that simultaneously meets all prescribed demands with available supplies.
I thought to solve it in the following way:
Consider a source $S^*$ which contains the multiple source as its node and $T^*$ as sink containing the multiple sinks, then using the theorem which says, If U is the set of nodes in a network, then the net flow out of U is the sum of the nodes in U.
Yet I am not confirmed whether the argument is correct or not.
graph-theory network-flow
asked Jan 29 at 19:08
bandana pandeybandana pandey
63
$endgroup$
add a comment |
$begingroup$
Formulate and prove a theorem that gives necessary and sufficient conditions so that a network with multiple sources and sinks has a flow that simultaneously meets all prescribed demands with available supplies.
I thought to solve it in the following way:
Consider a source $S^*$ which contains the multiple source as its node and $T^*$ as sink containing the multiple sinks, then using the theorem which says, If U is the set of nodes in a network, then the net flow out of U is the sum of the nodes in U.
Yet I am not confirmed whether the argument is correct or not.
graph-theory network-flow
asked Jan 29 at 19:08
bandana pandeybandana pandey
63
$endgroup$
add a comment |
$begingroup$
Formulate and prove a theorem that gives necessary and sufficient conditions so that a network with multiple sources and sinks has a flow that simultaneously meets all prescribed demands with available supplies.
I thought to solve it in the following way:
Consider a source $S^*$ which contains the multiple source as its node and $T^*$ as sink containing the multiple sinks, then using the theorem which says, If U is the set of nodes in a network, then the net flow out of U is the sum of the nodes in U.
Yet I am not confirmed whether the argument is correct or not.
graph-theory network-flow
asked Jan 29 at 19:08
bandana pandeybandana pandey
63
$endgroup$
Formulate and prove a theorem that gives necessary and sufficient conditions so that a network with multiple sources and sinks has a flow that simultaneously meets all prescribed demands with available supplies.
I thought to solve it in the following way:
Consider a source $S^*$ which contains the multiple source as its node and $T^*$ as sink containing the multiple sinks, then using the theorem which says, If U is the set of nodes in a network, then the net flow out of U is the sum of the nodes in U.
Yet I am not confirmed whether the argument is correct or not.
graph-theory network-flow
graph-theory network-flow
asked Jan 29 at 19:08
bandana pandeybandana pandey
63
asked Jan 29 at 19:08
bandana pandeybandana pandey
63
edited Jan 29 at 19:24
bandana pandey
asked Jan 29 at 19:08
bandana pandeybandana pandey
63
asked Jan 29 at 19:08
bandana pandeybandana pandey
63
asked Jan 29 at 19:08
bandana pandeybandana pandey
63
63
add a comment |
add a comment |
0
active
oldest
votes
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3092593%2fhow-to-formulate-and-prove-networking-problem%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3092593%2fhow-to-formulate-and-prove-networking-problem%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
