Pulling a graph across a partition
$begingroup$
I am looking for the name for a particular graph property, if it has been studied, and efficient algorithms for computing it, if they exist. I realise that this may be a well known property that I am just ignorant of, in which case I apologise, and would be grateful to be set right.
The property is as follows:
Take a graph $G=(V,E)$ on $n$ vertices, where $V$ is the vertex set and $E$ is the edge set. Let me define two families of subsets of vertices, $A_i$ and $B_i$, with the relationship that $B = V setminus A$. I require that $A_0 = V$ and $A_n$ is the empty set. Each intermediate $A_i$ is obtained from $A_{I-1}$ by removing one vertex (according to some strategy). The property I care about is $max_i |{(a,b): ain A_i, bin B_i,(a,b) in E}|$, minimised over all strategies for choosing $A_1 ldots A_{n-1}$ according to the rules above.
$A_i$ and $B_i$ can be thought of as the $i$th step in a process of moving vertices of the graph from one side of a partition (the $A$ side) to the other (the $B$ side). Thus the property I am concerned with has an operational interpretation as the maximum number of edges that need to cross the partition at any one point in time as we move the graph from one side to another, minimised over all strategies for moving vertices across the partition.
Aside from computing the value of this property, an algorithm for determining the optimal strategy would also be helpful.
graph-theory graph-algorithms co.combinatorics
asked Dec 2 '18 at 1:51
Joe FitzsimonsJoe Fitzsimons
11.5k3685
$endgroup$
add a comment |
$begingroup$
I am looking for the name for a particular graph property, if it has been studied, and efficient algorithms for computing it, if they exist. I realise that this may be a well known property that I am just ignorant of, in which case I apologise, and would be grateful to be set right.
The property is as follows:
Take a graph $G=(V,E)$ on $n$ vertices, where $V$ is the vertex set and $E$ is the edge set. Let me define two families of subsets of vertices, $A_i$ and $B_i$, with the relationship that $B = V setminus A$. I require that $A_0 = V$ and $A_n$ is the empty set. Each intermediate $A_i$ is obtained from $A_{I-1}$ by removing one vertex (according to some strategy). The property I care about is $max_i |{(a,b): ain A_i, bin B_i,(a,b) in E}|$, minimised over all strategies for choosing $A_1 ldots A_{n-1}$ according to the rules above.
$A_i$ and $B_i$ can be thought of as the $i$th step in a process of moving vertices of the graph from one side of a partition (the $A$ side) to the other (the $B$ side). Thus the property I am concerned with has an operational interpretation as the maximum number of edges that need to cross the partition at any one point in time as we move the graph from one side to another, minimised over all strategies for moving vertices across the partition.
Aside from computing the value of this property, an algorithm for determining the optimal strategy would also be helpful.
graph-theory graph-algorithms co.combinatorics
asked Dec 2 '18 at 1:51
Joe FitzsimonsJoe Fitzsimons
11.5k3685
$endgroup$
add a comment |
$begingroup$
I am looking for the name for a particular graph property, if it has been studied, and efficient algorithms for computing it, if they exist. I realise that this may be a well known property that I am just ignorant of, in which case I apologise, and would be grateful to be set right.
The property is as follows:
Take a graph $G=(V,E)$ on $n$ vertices, where $V$ is the vertex set and $E$ is the edge set. Let me define two families of subsets of vertices, $A_i$ and $B_i$, with the relationship that $B = V setminus A$. I require that $A_0 = V$ and $A_n$ is the empty set. Each intermediate $A_i$ is obtained from $A_{I-1}$ by removing one vertex (according to some strategy). The property I care about is $max_i |{(a,b): ain A_i, bin B_i,(a,b) in E}|$, minimised over all strategies for choosing $A_1 ldots A_{n-1}$ according to the rules above.
$A_i$ and $B_i$ can be thought of as the $i$th step in a process of moving vertices of the graph from one side of a partition (the $A$ side) to the other (the $B$ side). Thus the property I am concerned with has an operational interpretation as the maximum number of edges that need to cross the partition at any one point in time as we move the graph from one side to another, minimised over all strategies for moving vertices across the partition.
Aside from computing the value of this property, an algorithm for determining the optimal strategy would also be helpful.
graph-theory graph-algorithms co.combinatorics
asked Dec 2 '18 at 1:51
Joe FitzsimonsJoe Fitzsimons
11.5k3685
$endgroup$
I am looking for the name for a particular graph property, if it has been studied, and efficient algorithms for computing it, if they exist. I realise that this may be a well known property that I am just ignorant of, in which case I apologise, and would be grateful to be set right.
The property is as follows:
Take a graph $G=(V,E)$ on $n$ vertices, where $V$ is the vertex set and $E$ is the edge set. Let me define two families of subsets of vertices, $A_i$ and $B_i$, with the relationship that $B = V setminus A$. I require that $A_0 = V$ and $A_n$ is the empty set. Each intermediate $A_i$ is obtained from $A_{I-1}$ by removing one vertex (according to some strategy). The property I care about is $max_i |{(a,b): ain A_i, bin B_i,(a,b) in E}|$, minimised over all strategies for choosing $A_1 ldots A_{n-1}$ according to the rules above.
$A_i$ and $B_i$ can be thought of as the $i$th step in a process of moving vertices of the graph from one side of a partition (the $A$ side) to the other (the $B$ side). Thus the property I am concerned with has an operational interpretation as the maximum number of edges that need to cross the partition at any one point in time as we move the graph from one side to another, minimised over all strategies for moving vertices across the partition.
Aside from computing the value of this property, an algorithm for determining the optimal strategy would also be helpful.
graph-theory graph-algorithms co.combinatorics
graph-theory graph-algorithms co.combinatorics
asked Dec 2 '18 at 1:51
Joe FitzsimonsJoe Fitzsimons
11.5k3685
asked Dec 2 '18 at 1:51
Joe FitzsimonsJoe Fitzsimons
11.5k3685
asked Dec 2 '18 at 1:51
Joe FitzsimonsJoe Fitzsimons
11.5k3685
asked Dec 2 '18 at 1:51
Joe FitzsimonsJoe Fitzsimons
11.5k3685
asked Dec 2 '18 at 1:51
Joe FitzsimonsJoe Fitzsimons
11.5k3685
11.5k3685
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
What you are looking for is known as Cutwidth. The problem is NP complete and quite well studied. For example it has a $O((log n)^{3/2})$- approximation algorithm and is fixed parameter tractable when parameterized by the objective function value.
answered Dec 2 '18 at 4:39
daniellodaniello
2,6561124
$endgroup$
$begingroup$
Thanks. That helps a lot. Do you have a reference for the approximation algorithm?
$endgroup$
– Joe Fitzsimons
Dec 2 '18 at 6:15
1
$begingroup$
A paper to cite does not come to mind but it is just applying the $sqrt{log n}$ approximation for balanced cut (Arora, Rao, Vazirani) in a divide and conquer manner (find balanced cut, solve the two sides recursively, put solution to left side before the solution to the right side). Better algorithms might be known, I am not sure.
$endgroup$
– daniello
Dec 2 '18 at 6:30
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: "114"
};
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: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
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%2fcstheory.stackexchange.com%2fquestions%2f41975%2fpulling-a-graph-across-a-partition%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$
What you are looking for is known as Cutwidth. The problem is NP complete and quite well studied. For example it has a $O((log n)^{3/2})$- approximation algorithm and is fixed parameter tractable when parameterized by the objective function value.
answered Dec 2 '18 at 4:39
daniellodaniello
2,6561124
$endgroup$
$begingroup$
Thanks. That helps a lot. Do you have a reference for the approximation algorithm?
$endgroup$
– Joe Fitzsimons
Dec 2 '18 at 6:15
1
$begingroup$
A paper to cite does not come to mind but it is just applying the $sqrt{log n}$ approximation for balanced cut (Arora, Rao, Vazirani) in a divide and conquer manner (find balanced cut, solve the two sides recursively, put solution to left side before the solution to the right side). Better algorithms might be known, I am not sure.
$endgroup$
– daniello
Dec 2 '18 at 6:30
add a comment |
$begingroup$
What you are looking for is known as Cutwidth. The problem is NP complete and quite well studied. For example it has a $O((log n)^{3/2})$- approximation algorithm and is fixed parameter tractable when parameterized by the objective function value.
answered Dec 2 '18 at 4:39
daniellodaniello
2,6561124
$endgroup$
$begingroup$
Thanks. That helps a lot. Do you have a reference for the approximation algorithm?
$endgroup$
– Joe Fitzsimons
Dec 2 '18 at 6:15
1
$begingroup$
A paper to cite does not come to mind but it is just applying the $sqrt{log n}$ approximation for balanced cut (Arora, Rao, Vazirani) in a divide and conquer manner (find balanced cut, solve the two sides recursively, put solution to left side before the solution to the right side). Better algorithms might be known, I am not sure.
$endgroup$
– daniello
Dec 2 '18 at 6:30
add a comment |
$begingroup$
What you are looking for is known as Cutwidth. The problem is NP complete and quite well studied. For example it has a $O((log n)^{3/2})$- approximation algorithm and is fixed parameter tractable when parameterized by the objective function value.
answered Dec 2 '18 at 4:39
daniellodaniello
2,6561124
$endgroup$
What you are looking for is known as Cutwidth. The problem is NP complete and quite well studied. For example it has a $O((log n)^{3/2})$- approximation algorithm and is fixed parameter tractable when parameterized by the objective function value.
answered Dec 2 '18 at 4:39
daniellodaniello
2,6561124
answered Dec 2 '18 at 4:39
daniellodaniello
2,6561124
answered Dec 2 '18 at 4:39
daniellodaniello
2,6561124
answered Dec 2 '18 at 4:39
daniellodaniello
2,6561124
2,6561124
$begingroup$
Thanks. That helps a lot. Do you have a reference for the approximation algorithm?
$endgroup$
– Joe Fitzsimons
Dec 2 '18 at 6:15
1
$begingroup$
A paper to cite does not come to mind but it is just applying the $sqrt{log n}$ approximation for balanced cut (Arora, Rao, Vazirani) in a divide and conquer manner (find balanced cut, solve the two sides recursively, put solution to left side before the solution to the right side). Better algorithms might be known, I am not sure.
$endgroup$
– daniello
Dec 2 '18 at 6:30
add a comment |
$begingroup$
Thanks. That helps a lot. Do you have a reference for the approximation algorithm?
$endgroup$
– Joe Fitzsimons
Dec 2 '18 at 6:15
1
$begingroup$
A paper to cite does not come to mind but it is just applying the $sqrt{log n}$ approximation for balanced cut (Arora, Rao, Vazirani) in a divide and conquer manner (find balanced cut, solve the two sides recursively, put solution to left side before the solution to the right side). Better algorithms might be known, I am not sure.
$endgroup$
– daniello
Dec 2 '18 at 6:30
$begingroup$
Thanks. That helps a lot. Do you have a reference for the approximation algorithm?
$endgroup$
– Joe Fitzsimons
Dec 2 '18 at 6:15
$begingroup$
Thanks. That helps a lot. Do you have a reference for the approximation algorithm?
$endgroup$
– Joe Fitzsimons
Dec 2 '18 at 6:15
1
1
$begingroup$
A paper to cite does not come to mind but it is just applying the $sqrt{log n}$ approximation for balanced cut (Arora, Rao, Vazirani) in a divide and conquer manner (find balanced cut, solve the two sides recursively, put solution to left side before the solution to the right side). Better algorithms might be known, I am not sure.
$endgroup$
– daniello
Dec 2 '18 at 6:30
$begingroup$
A paper to cite does not come to mind but it is just applying the $sqrt{log n}$ approximation for balanced cut (Arora, Rao, Vazirani) in a divide and conquer manner (find balanced cut, solve the two sides recursively, put solution to left side before the solution to the right side). Better algorithms might be known, I am not sure.
$endgroup$
– daniello
Dec 2 '18 at 6:30
add a comment |
Thanks for contributing an answer to Theoretical Computer Science 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%2fcstheory.stackexchange.com%2fquestions%2f41975%2fpulling-a-graph-across-a-partition%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
