prevent time collision in N Course initiation for M Student
0
$begingroup$
Hypothesis: we have n courses and m students. we decide to initiate a sample course program named Math123. how many Time Unit do we need to Students will not have two different courses at the same time.
the reason is to prevent time collision.
graph-theory education collision-detection
asked Dec 21 '18 at 23:20
Mohi72Mohi72
1013
$endgroup$
add a comment |
0
$begingroup$
Hypothesis: we have n courses and m students. we decide to initiate a sample course program named Math123. how many Time Unit do we need to Students will not have two different courses at the same time.
the reason is to prevent time collision.
graph-theory education collision-detection
asked Dec 21 '18 at 23:20
Mohi72Mohi72
1013
$endgroup$
add a comment |
0
0
0
$begingroup$
Hypothesis: we have n courses and m students. we decide to initiate a sample course program named Math123. how many Time Unit do we need to Students will not have two different courses at the same time.
the reason is to prevent time collision.
graph-theory education collision-detection
asked Dec 21 '18 at 23:20
Mohi72Mohi72
1013
$endgroup$
Hypothesis: we have n courses and m students. we decide to initiate a sample course program named Math123. how many Time Unit do we need to Students will not have two different courses at the same time.
the reason is to prevent time collision.
graph-theory education collision-detection
graph-theory education collision-detection
asked Dec 21 '18 at 23:20
Mohi72Mohi72
1013
asked Dec 21 '18 at 23:20
Mohi72Mohi72
1013
asked Dec 21 '18 at 23:20
Mohi72Mohi72
1013
asked Dec 21 '18 at 23:20
Mohi72Mohi72
1013
asked Dec 21 '18 at 23:20
Mohi72Mohi72
1013
1013
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
0
$begingroup$
If I’m interpreting this correctly, we form the graph on the classes where two classes are adjacent if they have a common student. Then you want to know the chromatic number of this graph.
answered Dec 22 '18 at 5:17
Bob KruegerBob Krueger
4,1602722
$endgroup$
$begingroup$
yeap and how can I calculate the chromatic number?
$endgroup$
– Mohi72
Dec 22 '18 at 7:52
$begingroup$
It’s well studied and NP-HARD. This is a special kind of graph, so there may be a different framing that presents a more efficient solution.
$endgroup$
– Bob Krueger
Dec 22 '18 at 11:51
$begingroup$
Yeah: on second thought, the original problem is equivalent to finding the chromatic index of an arbitrary hypergraph (students are vertices, classes are edges). I’m sure this is also well studied and hard.
$endgroup$
– Bob Krueger
Dec 22 '18 at 11:55
$begingroup$
Dear @Bob Krueger, Thanks a lot. i was wondering to visualize such these problems
$endgroup$
– Mohi72
Dec 22 '18 at 16:19
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
});
}
});
draft saved
draft discarded
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%2f3048994%2fprevent-time-collision-in-n-course-initiation-for-m-student%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
0
$begingroup$
If I’m interpreting this correctly, we form the graph on the classes where two classes are adjacent if they have a common student. Then you want to know the chromatic number of this graph.
answered Dec 22 '18 at 5:17
Bob KruegerBob Krueger
4,1602722
$endgroup$
$begingroup$
yeap and how can I calculate the chromatic number?
$endgroup$
– Mohi72
Dec 22 '18 at 7:52
$begingroup$
It’s well studied and NP-HARD. This is a special kind of graph, so there may be a different framing that presents a more efficient solution.
$endgroup$
– Bob Krueger
Dec 22 '18 at 11:51
$begingroup$
Yeah: on second thought, the original problem is equivalent to finding the chromatic index of an arbitrary hypergraph (students are vertices, classes are edges). I’m sure this is also well studied and hard.
$endgroup$
– Bob Krueger
Dec 22 '18 at 11:55
$begingroup$
Dear @Bob Krueger, Thanks a lot. i was wondering to visualize such these problems
$endgroup$
– Mohi72
Dec 22 '18 at 16:19
add a comment |
0
$begingroup$
If I’m interpreting this correctly, we form the graph on the classes where two classes are adjacent if they have a common student. Then you want to know the chromatic number of this graph.
answered Dec 22 '18 at 5:17
Bob KruegerBob Krueger
4,1602722
$endgroup$
$begingroup$
yeap and how can I calculate the chromatic number?
$endgroup$
– Mohi72
Dec 22 '18 at 7:52
$begingroup$
It’s well studied and NP-HARD. This is a special kind of graph, so there may be a different framing that presents a more efficient solution.
$endgroup$
– Bob Krueger
Dec 22 '18 at 11:51
$begingroup$
Yeah: on second thought, the original problem is equivalent to finding the chromatic index of an arbitrary hypergraph (students are vertices, classes are edges). I’m sure this is also well studied and hard.
$endgroup$
– Bob Krueger
Dec 22 '18 at 11:55
$begingroup$
Dear @Bob Krueger, Thanks a lot. i was wondering to visualize such these problems
$endgroup$
– Mohi72
Dec 22 '18 at 16:19
add a comment |
0
0
0
$begingroup$
If I’m interpreting this correctly, we form the graph on the classes where two classes are adjacent if they have a common student. Then you want to know the chromatic number of this graph.
answered Dec 22 '18 at 5:17
Bob KruegerBob Krueger
4,1602722
$endgroup$
If I’m interpreting this correctly, we form the graph on the classes where two classes are adjacent if they have a common student. Then you want to know the chromatic number of this graph.
answered Dec 22 '18 at 5:17
Bob KruegerBob Krueger
4,1602722
answered Dec 22 '18 at 5:17
Bob KruegerBob Krueger
4,1602722
answered Dec 22 '18 at 5:17
Bob KruegerBob Krueger
4,1602722
answered Dec 22 '18 at 5:17
Bob KruegerBob Krueger
4,1602722
4,1602722
$begingroup$
yeap and how can I calculate the chromatic number?
$endgroup$
– Mohi72
Dec 22 '18 at 7:52
$begingroup$
It’s well studied and NP-HARD. This is a special kind of graph, so there may be a different framing that presents a more efficient solution.
$endgroup$
– Bob Krueger
Dec 22 '18 at 11:51
$begingroup$
Yeah: on second thought, the original problem is equivalent to finding the chromatic index of an arbitrary hypergraph (students are vertices, classes are edges). I’m sure this is also well studied and hard.
$endgroup$
– Bob Krueger
Dec 22 '18 at 11:55
$begingroup$
Dear @Bob Krueger, Thanks a lot. i was wondering to visualize such these problems
$endgroup$
– Mohi72
Dec 22 '18 at 16:19
add a comment |
$begingroup$
yeap and how can I calculate the chromatic number?
$endgroup$
– Mohi72
Dec 22 '18 at 7:52
$begingroup$
It’s well studied and NP-HARD. This is a special kind of graph, so there may be a different framing that presents a more efficient solution.
$endgroup$
– Bob Krueger
Dec 22 '18 at 11:51
$begingroup$
Yeah: on second thought, the original problem is equivalent to finding the chromatic index of an arbitrary hypergraph (students are vertices, classes are edges). I’m sure this is also well studied and hard.
$endgroup$
– Bob Krueger
Dec 22 '18 at 11:55
$begingroup$
Dear @Bob Krueger, Thanks a lot. i was wondering to visualize such these problems
$endgroup$
– Mohi72
Dec 22 '18 at 16:19
$begingroup$
yeap and how can I calculate the chromatic number?
$endgroup$
– Mohi72
Dec 22 '18 at 7:52
$begingroup$
yeap and how can I calculate the chromatic number?
$endgroup$
– Mohi72
Dec 22 '18 at 7:52
$begingroup$
It’s well studied and NP-HARD. This is a special kind of graph, so there may be a different framing that presents a more efficient solution.
$endgroup$
– Bob Krueger
Dec 22 '18 at 11:51
$begingroup$
It’s well studied and NP-HARD. This is a special kind of graph, so there may be a different framing that presents a more efficient solution.
$endgroup$
– Bob Krueger
Dec 22 '18 at 11:51
$begingroup$
Yeah: on second thought, the original problem is equivalent to finding the chromatic index of an arbitrary hypergraph (students are vertices, classes are edges). I’m sure this is also well studied and hard.
$endgroup$
– Bob Krueger
Dec 22 '18 at 11:55
$begingroup$
Yeah: on second thought, the original problem is equivalent to finding the chromatic index of an arbitrary hypergraph (students are vertices, classes are edges). I’m sure this is also well studied and hard.
$endgroup$
– Bob Krueger
Dec 22 '18 at 11:55
$begingroup$
Dear @Bob Krueger, Thanks a lot. i was wondering to visualize such these problems
$endgroup$
– Mohi72
Dec 22 '18 at 16:19
$begingroup$
Dear @Bob Krueger, Thanks a lot. i was wondering to visualize such these problems
$endgroup$
– Mohi72
Dec 22 '18 at 16:19
add a comment |
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.
draft saved
draft discarded
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%2f3048994%2fprevent-time-collision-in-n-course-initiation-for-m-student%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
