What is the literature on optimizing for maximum nodes in a graph without cycles?
I have an arbitrary directed, non-complete graph. I would like to find a maximal subset of nodes within that graph such that the induced subgraph has no cycles. I'm sure there must be a name for this problem in the literature - do you know what it is?
combinatorics graph-theory
asked Dec 2 at 2:21
lightning
1034
add a comment |
I have an arbitrary directed, non-complete graph. I would like to find a maximal subset of nodes within that graph such that the induced subgraph has no cycles. I'm sure there must be a name for this problem in the literature - do you know what it is?
combinatorics graph-theory
asked Dec 2 at 2:21
lightning
1034
Thanks! Do you know how I can mark the question as answered, given that you answered in a comment?
– lightning
Dec 2 at 3:51
I just transferred my comment to answer. So I will delete that comment.
– Michael
Dec 2 at 4:55
add a comment |
I have an arbitrary directed, non-complete graph. I would like to find a maximal subset of nodes within that graph such that the induced subgraph has no cycles. I'm sure there must be a name for this problem in the literature - do you know what it is?
combinatorics graph-theory
asked Dec 2 at 2:21
lightning
1034
I have an arbitrary directed, non-complete graph. I would like to find a maximal subset of nodes within that graph such that the induced subgraph has no cycles. I'm sure there must be a name for this problem in the literature - do you know what it is?
combinatorics graph-theory
combinatorics graph-theory
asked Dec 2 at 2:21
lightning
1034
asked Dec 2 at 2:21
lightning
1034
edited Dec 2 at 2:32
asked Dec 2 at 2:21
lightning
1034
asked Dec 2 at 2:21
lightning
1034
asked Dec 2 at 2:21
lightning
1034
1034
Thanks! Do you know how I can mark the question as answered, given that you answered in a comment?
– lightning
Dec 2 at 3:51
I just transferred my comment to answer. So I will delete that comment.
– Michael
Dec 2 at 4:55
add a comment |
Thanks! Do you know how I can mark the question as answered, given that you answered in a comment?
– lightning
Dec 2 at 3:51
I just transferred my comment to answer. So I will delete that comment.
– Michael
Dec 2 at 4:55
Thanks! Do you know how I can mark the question as answered, given that you answered in a comment?
– lightning
Dec 2 at 3:51
Thanks! Do you know how I can mark the question as answered, given that you answered in a comment?
– lightning
Dec 2 at 3:51
I just transferred my comment to answer. So I will delete that comment.
– Michael
Dec 2 at 4:55
I just transferred my comment to answer. So I will delete that comment.
– Michael
Dec 2 at 4:55
add a comment |
1 Answer
1
active
oldest
votes
This is the "maximum acyclic subgraph" problem (just search Google).
I once used such a thing for an info-theory bound on an "index coding" problem (but for a directed graph in that case), Lemma 1 here:
http://ee.usc.edu/stochastic-nets/docs/dynamic-index-coding-it.pdf
answered Dec 2 at 4:54
Michael
13.2k11325
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%2f3022140%2fwhat-is-the-literature-on-optimizing-for-maximum-nodes-in-a-graph-without-cycles%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
This is the "maximum acyclic subgraph" problem (just search Google).
I once used such a thing for an info-theory bound on an "index coding" problem (but for a directed graph in that case), Lemma 1 here:
http://ee.usc.edu/stochastic-nets/docs/dynamic-index-coding-it.pdf
answered Dec 2 at 4:54
Michael
13.2k11325
add a comment |
This is the "maximum acyclic subgraph" problem (just search Google).
I once used such a thing for an info-theory bound on an "index coding" problem (but for a directed graph in that case), Lemma 1 here:
http://ee.usc.edu/stochastic-nets/docs/dynamic-index-coding-it.pdf
answered Dec 2 at 4:54
Michael
13.2k11325
add a comment |
This is the "maximum acyclic subgraph" problem (just search Google).
I once used such a thing for an info-theory bound on an "index coding" problem (but for a directed graph in that case), Lemma 1 here:
http://ee.usc.edu/stochastic-nets/docs/dynamic-index-coding-it.pdf
answered Dec 2 at 4:54
Michael
13.2k11325
This is the "maximum acyclic subgraph" problem (just search Google).
I once used such a thing for an info-theory bound on an "index coding" problem (but for a directed graph in that case), Lemma 1 here:
http://ee.usc.edu/stochastic-nets/docs/dynamic-index-coding-it.pdf
answered Dec 2 at 4:54
Michael
13.2k11325
answered Dec 2 at 4:54
Michael
13.2k11325
answered Dec 2 at 4:54
Michael
13.2k11325
answered Dec 2 at 4:54
Michael
13.2k11325
13.2k11325
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.
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.
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%2f3022140%2fwhat-is-the-literature-on-optimizing-for-maximum-nodes-in-a-graph-without-cycles%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
Thanks! Do you know how I can mark the question as answered, given that you answered in a comment?
– lightning
Dec 2 at 3:51
I just transferred my comment to answer. So I will delete that comment.
– Michael
Dec 2 at 4:55