Min-Graph Equipartition Problem

Multi tool use
Multi tool use












1














Can someone plis help me with this problem.



Split the graph into two parts of almost the same size
with the smallest number of edges between the two parts.










share|cite|improve this question






















  • "Almost the same size" means that the difference betweenf the parts sizes is at most $1$?
    – Alex Ravsky
    Dec 9 at 8:52








  • 1




    I think so. There is just a hint: solve it using a greedy method and using the simulated annealing heuristic. And nothing else.
    – what_456
    Dec 9 at 9:37










  • I think a paper “An Efficient Algorithm for Graph Bisection of Triangularizations” by Gerold Jäger is relevant.
    – Alex Ravsky
    Dec 9 at 10:01
















1














Can someone plis help me with this problem.



Split the graph into two parts of almost the same size
with the smallest number of edges between the two parts.










share|cite|improve this question






















  • "Almost the same size" means that the difference betweenf the parts sizes is at most $1$?
    – Alex Ravsky
    Dec 9 at 8:52








  • 1




    I think so. There is just a hint: solve it using a greedy method and using the simulated annealing heuristic. And nothing else.
    – what_456
    Dec 9 at 9:37










  • I think a paper “An Efficient Algorithm for Graph Bisection of Triangularizations” by Gerold Jäger is relevant.
    – Alex Ravsky
    Dec 9 at 10:01














1












1








1







Can someone plis help me with this problem.



Split the graph into two parts of almost the same size
with the smallest number of edges between the two parts.










share|cite|improve this question













Can someone plis help me with this problem.



Split the graph into two parts of almost the same size
with the smallest number of edges between the two parts.







graph-theory






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Dec 9 at 8:44









what_456

83




83












  • "Almost the same size" means that the difference betweenf the parts sizes is at most $1$?
    – Alex Ravsky
    Dec 9 at 8:52








  • 1




    I think so. There is just a hint: solve it using a greedy method and using the simulated annealing heuristic. And nothing else.
    – what_456
    Dec 9 at 9:37










  • I think a paper “An Efficient Algorithm for Graph Bisection of Triangularizations” by Gerold Jäger is relevant.
    – Alex Ravsky
    Dec 9 at 10:01


















  • "Almost the same size" means that the difference betweenf the parts sizes is at most $1$?
    – Alex Ravsky
    Dec 9 at 8:52








  • 1




    I think so. There is just a hint: solve it using a greedy method and using the simulated annealing heuristic. And nothing else.
    – what_456
    Dec 9 at 9:37










  • I think a paper “An Efficient Algorithm for Graph Bisection of Triangularizations” by Gerold Jäger is relevant.
    – Alex Ravsky
    Dec 9 at 10:01
















"Almost the same size" means that the difference betweenf the parts sizes is at most $1$?
– Alex Ravsky
Dec 9 at 8:52






"Almost the same size" means that the difference betweenf the parts sizes is at most $1$?
– Alex Ravsky
Dec 9 at 8:52






1




1




I think so. There is just a hint: solve it using a greedy method and using the simulated annealing heuristic. And nothing else.
– what_456
Dec 9 at 9:37




I think so. There is just a hint: solve it using a greedy method and using the simulated annealing heuristic. And nothing else.
– what_456
Dec 9 at 9:37












I think a paper “An Efficient Algorithm for Graph Bisection of Triangularizations” by Gerold Jäger is relevant.
– Alex Ravsky
Dec 9 at 10:01




I think a paper “An Efficient Algorithm for Graph Bisection of Triangularizations” by Gerold Jäger is relevant.
– Alex Ravsky
Dec 9 at 10:01















active

oldest

votes











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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3032168%2fmin-graph-equipartition-problem%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown






























active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































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.





Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


Please pay close attention to the following guidance:


  • 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.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3032168%2fmin-graph-equipartition-problem%23new-answer', 'question_page');
}
);

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







i,HlZ38pDyoFRPvnljN2rg4eDUIC XgHDa,RBuUJ YoMlTW0,mNcU4e4Sealx2zq2Fk7nXML6y 8pcwhG
pAY,vlTu9Z VNvl721edomzwdgZBcwoSaE2LC8903f a,Vk5YTH4FvVygFa7,2 tVrE4L Y6MgHGnQH6 J

Popular posts from this blog

Bressuire

Cabo Verde

Gyllenstierna