Split network flow function
$begingroup$
Let
a graph $G = (V,E)$
a network $N = (G, s, t, c)$
and an integral flow funtion $f$
The value of f $v(f)=v_1+v_2+...+v_p$, where $v_i$ is a flow leaving the source.
I must prove that there are $p$ integral flows functions so that $v(f_i)=v_i$ and
$f = f_1+f_2+...+f_p$.
So I have to split the initial flow into $p$ flows so that the sum of the new flows is the original flow and $v(fi)=vi$.
I followed those instructions manually on some examples, but I can't find an algorithm to fit on all cases.
Any ideas on how I should do it?
graph-theory network-flow network
asked Jan 8 at 22:34
qpBlazeqpBlaze
61
$endgroup$
add a comment |
$begingroup$
Let
a graph $G = (V,E)$
a network $N = (G, s, t, c)$
and an integral flow funtion $f$
The value of f $v(f)=v_1+v_2+...+v_p$, where $v_i$ is a flow leaving the source.
I must prove that there are $p$ integral flows functions so that $v(f_i)=v_i$ and
$f = f_1+f_2+...+f_p$.
So I have to split the initial flow into $p$ flows so that the sum of the new flows is the original flow and $v(fi)=vi$.
I followed those instructions manually on some examples, but I can't find an algorithm to fit on all cases.
Any ideas on how I should do it?
graph-theory network-flow network
asked Jan 8 at 22:34
qpBlazeqpBlaze
61
$endgroup$
add a comment |
$begingroup$
Let
a graph $G = (V,E)$
a network $N = (G, s, t, c)$
and an integral flow funtion $f$
The value of f $v(f)=v_1+v_2+...+v_p$, where $v_i$ is a flow leaving the source.
I must prove that there are $p$ integral flows functions so that $v(f_i)=v_i$ and
$f = f_1+f_2+...+f_p$.
So I have to split the initial flow into $p$ flows so that the sum of the new flows is the original flow and $v(fi)=vi$.
I followed those instructions manually on some examples, but I can't find an algorithm to fit on all cases.
Any ideas on how I should do it?
graph-theory network-flow network
asked Jan 8 at 22:34
qpBlazeqpBlaze
61
$endgroup$
Let
a graph $G = (V,E)$
a network $N = (G, s, t, c)$
and an integral flow funtion $f$
The value of f $v(f)=v_1+v_2+...+v_p$, where $v_i$ is a flow leaving the source.
I must prove that there are $p$ integral flows functions so that $v(f_i)=v_i$ and
$f = f_1+f_2+...+f_p$.
So I have to split the initial flow into $p$ flows so that the sum of the new flows is the original flow and $v(fi)=vi$.
I followed those instructions manually on some examples, but I can't find an algorithm to fit on all cases.
Any ideas on how I should do it?
graph-theory network-flow network
graph-theory network-flow network
asked Jan 8 at 22:34
qpBlazeqpBlaze
61
asked Jan 8 at 22:34
qpBlazeqpBlaze
61
asked Jan 8 at 22:34
qpBlazeqpBlaze
61
asked Jan 8 at 22:34
qpBlazeqpBlaze
61
asked Jan 8 at 22:34
qpBlazeqpBlaze
61
61
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
I am not perfectly sure that I correctly interpreted all notions, not defined in the question, but I guess that the following solution is OK.
It suffices to prove the claim when $v_i=1$ for each $i$. This will allow us to split the flow $f$ into $v(f)$ flows with value $1$ each. Then given arbitrary natural $v_i$’s with $sum v_i=v(f)$, we partition these $v(f)$ onto $p$ groups consisting of $v_1,dots, v_p$ flows respectively, and next for each $i$ we merge flows of $i$-th group into one flow with value $v_i$.
We prove the possibility of splitting a flow $f$ into $v(f)$ flows of value $1$ by induction with respect to $v(f)>0$. If $v(f)=1$ then we put $f_1=f$. Assume that we have already proved the claim for $v(f)=p$. Let $f$ be any feasible integral $s-t$ flow on $N$ with $v(f)=p+1$ Start from $s$ and go along the flow $f$ (that is, along edges $e$ such that $f(e)>0$), subtracting $1$ from $f$ on each passed edge. Since both the graph $G$ and the number $v(f)$ are finite, we can subtract only finitely many $1$’s, so we shall stick at some step. Since $operatorname{netinflow}(f, v)= operatorname{netoutlow} (f, v)$ for all vertices $v$ in $G$ except $s$ and $t$, and $operatorname{netinflow}(f, s)=0$, we can stick only at the vertex $t$. So we went a path from $s$ to $t$. This path endowed with the values which we subtracted, naturally generate an integral flow $f’$ from $s$ to to $t$ with $v(f’)=1$. Putting $f’’=f-f’$ we obtain a feasible integral $s-t$ flow on $N$ with $v(f’)=p$, which can be split into $p$ required flows by the induction hypothesis.
answered Jan 10 at 22:56
Alex RavskyAlex Ravsky
41.9k32383
$endgroup$
add a comment |
Your Answer
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%2f3066822%2fsplit-network-flow-function%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
I am not perfectly sure that I correctly interpreted all notions, not defined in the question, but I guess that the following solution is OK.
It suffices to prove the claim when $v_i=1$ for each $i$. This will allow us to split the flow $f$ into $v(f)$ flows with value $1$ each. Then given arbitrary natural $v_i$’s with $sum v_i=v(f)$, we partition these $v(f)$ onto $p$ groups consisting of $v_1,dots, v_p$ flows respectively, and next for each $i$ we merge flows of $i$-th group into one flow with value $v_i$.
We prove the possibility of splitting a flow $f$ into $v(f)$ flows of value $1$ by induction with respect to $v(f)>0$. If $v(f)=1$ then we put $f_1=f$. Assume that we have already proved the claim for $v(f)=p$. Let $f$ be any feasible integral $s-t$ flow on $N$ with $v(f)=p+1$ Start from $s$ and go along the flow $f$ (that is, along edges $e$ such that $f(e)>0$), subtracting $1$ from $f$ on each passed edge. Since both the graph $G$ and the number $v(f)$ are finite, we can subtract only finitely many $1$’s, so we shall stick at some step. Since $operatorname{netinflow}(f, v)= operatorname{netoutlow} (f, v)$ for all vertices $v$ in $G$ except $s$ and $t$, and $operatorname{netinflow}(f, s)=0$, we can stick only at the vertex $t$. So we went a path from $s$ to $t$. This path endowed with the values which we subtracted, naturally generate an integral flow $f’$ from $s$ to to $t$ with $v(f’)=1$. Putting $f’’=f-f’$ we obtain a feasible integral $s-t$ flow on $N$ with $v(f’)=p$, which can be split into $p$ required flows by the induction hypothesis.
answered Jan 10 at 22:56
Alex RavskyAlex Ravsky
41.9k32383
$endgroup$
add a comment |
$begingroup$
I am not perfectly sure that I correctly interpreted all notions, not defined in the question, but I guess that the following solution is OK.
It suffices to prove the claim when $v_i=1$ for each $i$. This will allow us to split the flow $f$ into $v(f)$ flows with value $1$ each. Then given arbitrary natural $v_i$’s with $sum v_i=v(f)$, we partition these $v(f)$ onto $p$ groups consisting of $v_1,dots, v_p$ flows respectively, and next for each $i$ we merge flows of $i$-th group into one flow with value $v_i$.
We prove the possibility of splitting a flow $f$ into $v(f)$ flows of value $1$ by induction with respect to $v(f)>0$. If $v(f)=1$ then we put $f_1=f$. Assume that we have already proved the claim for $v(f)=p$. Let $f$ be any feasible integral $s-t$ flow on $N$ with $v(f)=p+1$ Start from $s$ and go along the flow $f$ (that is, along edges $e$ such that $f(e)>0$), subtracting $1$ from $f$ on each passed edge. Since both the graph $G$ and the number $v(f)$ are finite, we can subtract only finitely many $1$’s, so we shall stick at some step. Since $operatorname{netinflow}(f, v)= operatorname{netoutlow} (f, v)$ for all vertices $v$ in $G$ except $s$ and $t$, and $operatorname{netinflow}(f, s)=0$, we can stick only at the vertex $t$. So we went a path from $s$ to $t$. This path endowed with the values which we subtracted, naturally generate an integral flow $f’$ from $s$ to to $t$ with $v(f’)=1$. Putting $f’’=f-f’$ we obtain a feasible integral $s-t$ flow on $N$ with $v(f’)=p$, which can be split into $p$ required flows by the induction hypothesis.
answered Jan 10 at 22:56
Alex RavskyAlex Ravsky
41.9k32383
$endgroup$
add a comment |
$begingroup$
I am not perfectly sure that I correctly interpreted all notions, not defined in the question, but I guess that the following solution is OK.
It suffices to prove the claim when $v_i=1$ for each $i$. This will allow us to split the flow $f$ into $v(f)$ flows with value $1$ each. Then given arbitrary natural $v_i$’s with $sum v_i=v(f)$, we partition these $v(f)$ onto $p$ groups consisting of $v_1,dots, v_p$ flows respectively, and next for each $i$ we merge flows of $i$-th group into one flow with value $v_i$.
We prove the possibility of splitting a flow $f$ into $v(f)$ flows of value $1$ by induction with respect to $v(f)>0$. If $v(f)=1$ then we put $f_1=f$. Assume that we have already proved the claim for $v(f)=p$. Let $f$ be any feasible integral $s-t$ flow on $N$ with $v(f)=p+1$ Start from $s$ and go along the flow $f$ (that is, along edges $e$ such that $f(e)>0$), subtracting $1$ from $f$ on each passed edge. Since both the graph $G$ and the number $v(f)$ are finite, we can subtract only finitely many $1$’s, so we shall stick at some step. Since $operatorname{netinflow}(f, v)= operatorname{netoutlow} (f, v)$ for all vertices $v$ in $G$ except $s$ and $t$, and $operatorname{netinflow}(f, s)=0$, we can stick only at the vertex $t$. So we went a path from $s$ to $t$. This path endowed with the values which we subtracted, naturally generate an integral flow $f’$ from $s$ to to $t$ with $v(f’)=1$. Putting $f’’=f-f’$ we obtain a feasible integral $s-t$ flow on $N$ with $v(f’)=p$, which can be split into $p$ required flows by the induction hypothesis.
answered Jan 10 at 22:56
Alex RavskyAlex Ravsky
41.9k32383
$endgroup$
I am not perfectly sure that I correctly interpreted all notions, not defined in the question, but I guess that the following solution is OK.
It suffices to prove the claim when $v_i=1$ for each $i$. This will allow us to split the flow $f$ into $v(f)$ flows with value $1$ each. Then given arbitrary natural $v_i$’s with $sum v_i=v(f)$, we partition these $v(f)$ onto $p$ groups consisting of $v_1,dots, v_p$ flows respectively, and next for each $i$ we merge flows of $i$-th group into one flow with value $v_i$.
We prove the possibility of splitting a flow $f$ into $v(f)$ flows of value $1$ by induction with respect to $v(f)>0$. If $v(f)=1$ then we put $f_1=f$. Assume that we have already proved the claim for $v(f)=p$. Let $f$ be any feasible integral $s-t$ flow on $N$ with $v(f)=p+1$ Start from $s$ and go along the flow $f$ (that is, along edges $e$ such that $f(e)>0$), subtracting $1$ from $f$ on each passed edge. Since both the graph $G$ and the number $v(f)$ are finite, we can subtract only finitely many $1$’s, so we shall stick at some step. Since $operatorname{netinflow}(f, v)= operatorname{netoutlow} (f, v)$ for all vertices $v$ in $G$ except $s$ and $t$, and $operatorname{netinflow}(f, s)=0$, we can stick only at the vertex $t$. So we went a path from $s$ to $t$. This path endowed with the values which we subtracted, naturally generate an integral flow $f’$ from $s$ to to $t$ with $v(f’)=1$. Putting $f’’=f-f’$ we obtain a feasible integral $s-t$ flow on $N$ with $v(f’)=p$, which can be split into $p$ required flows by the induction hypothesis.
answered Jan 10 at 22:56
Alex RavskyAlex Ravsky
41.9k32383
answered Jan 10 at 22:56
Alex RavskyAlex Ravsky
41.9k32383
answered Jan 10 at 22:56
Alex RavskyAlex Ravsky
41.9k32383
answered Jan 10 at 22:56
Alex RavskyAlex Ravsky
41.9k32383
41.9k32383
add a comment |
add a comment |
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%2f3066822%2fsplit-network-flow-function%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
