Timeline for Partition a graph into two clusters
Current License: CC BY-SA 4.0
33 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 12, 2022 at 3:15 | history | edited | ErroR | CC BY-SA 4.0 |
deleted 23 characters in body
|
| Oct 15, 2021 at 14:54 | comment | added | Neal Young | Hi Jut, I responded to your email. | |
| Oct 15, 2021 at 0:08 | comment | added | ErroR | @NealYoung Forgive me for that mistake. I sent, again an email for you. I hope you received my email. | |
| Oct 14, 2021 at 22:53 | comment | added | Neal Young | Jut, I did not. You'll have to substitute my actual last name and first name to get my email address. | |
| Oct 14, 2021 at 22:32 | comment | added | ErroR | @NealYoung Yesterday, I send an email to "[email protected]". I hope you received my email. Thank you. | |
| Oct 14, 2021 at 14:10 | comment | added | ErroR | Thank you. I send an email. With regard. | |
| Oct 14, 2021 at 12:57 | comment | added | Neal Young | Jut, I'm not available to Skype, but feel free to email me. | |
| Oct 14, 2021 at 10:54 | comment | added | ErroR | With regard, it's very crirtical for me that describe my problem for you in a short time in Skype. Please if it's possible, accept my request. Thanks. | |
| Oct 14, 2021 at 10:47 | comment | added | ErroR | I want be honest with you, because i find solution after reading a Thesis of a student and paper Suri, et-all, but your complete solution in the internet can be harm for my academic history. I think it's better to describe anything in Skype to you. I can't describe other things in this site. | |
| Oct 14, 2021 at 1:51 | comment | added | Neal Young | yes, go ahead. Also, if you think the answer to the now-undeleted post is correct, can you go ahead and accept it? | |
| Oct 13, 2021 at 22:02 | comment | added | ErroR | @NealYoung I undeleted the post. Can i ask my question by email? Thanks. | |
| Oct 13, 2021 at 20:25 | comment | added | Neal Young | Sure. FYI it looks like your post cstheory.stackexchange.com/questions/50494/… is still deleted (at the moment). A while back I made a copy with my answer here: cstheory.stackexchange.com/questions/50514/… | |
| Oct 13, 2021 at 19:44 | comment | added | ErroR | @NealYoung Thanks for your comment. I undelete your greatful answer. Also i have a question, can i ask you? | |
| Oct 6, 2021 at 14:12 | vote | accept | ErroR | ||
| Sep 20, 2021 at 2:23 | comment | added | Neal Young | Hi Jut, I think that with the post deleted you can still see it and the answer, so deleting effectively hides the post and answer only from others. For this reason, my vote would be to undelete it, so others can see it too. | |
| Sep 18, 2021 at 18:06 | comment | added | Neal Young | I see. In future posts please make it clearer what you are looking for. As it happens I spent some time thinking about how to answer your question and writing up and posting an answer for you, which from my point of view now was time wasted. I suppose if you wanted to you could undelete the post and not look at my answer (or look at it briefly if you want to get some idea), but it's up to you. :-) As for a copy of the paper, I don't need one, thanks. | |
| Sep 18, 2021 at 12:45 | comment | added | ErroR | @NealYoung I'm not agree with complete solution delete the post, so i delete the post. If you are not agree with me, i will restore it. Thanks. | |
| Sep 18, 2021 at 12:41 | comment | added | ErroR | @NealYoung Thanks, it's a great answer. But i think before reading your answer, i prefer to solve my problem by myself step by step, if it's possible and you are agree with me, i delete my post, because your solution is very complete and easily i can copy it that it's not good for me. If it's possible, i seek for some hint to progress my problem with myself. I forget to mentioned that in my post that i'm not agree with complete solution, because i want find solution step by step with myself. Also i have a copy of paper Monma and Suri, if you need i can scan it and send for you by email. | |
| Sep 18, 2021 at 12:15 | comment | added | Neal Young | Followup post with more details about the specific problem OP is interested in: cstheory.stackexchange.com/questions/50494/… | |
| Sep 17, 2021 at 22:03 | comment | added | ErroR | @NealYoung Yes i'm interested, thanks. | |
| Sep 14, 2021 at 15:32 | comment | added | Neal Young | See also OP's post (v). | |
| Sep 14, 2021 at 15:25 | comment | added | Neal Young | Note: OP, you have four posts, apparently about this question: (i), (ii), (iii), and (iv). These posts are all somewhat unclear, and cross-posting is discouraged. I suggest you delete the other three posts. | |
| Sep 11, 2021 at 19:40 | review | Close votes | |||
| Sep 20, 2021 at 3:05 | |||||
| Sep 10, 2021 at 22:35 | vote | accept | ErroR | ||
| Oct 6, 2021 at 14:10 | |||||
| Sep 10, 2021 at 20:53 | answer | added | Neal Young | timeline score: 2 | |
| Sep 10, 2021 at 17:53 | history | edited | ErroR | CC BY-SA 4.0 |
edited title
|
| Sep 10, 2021 at 16:23 | comment | added | ErroR | @NealYoung Thanks. Can you explain in more detail about your idea in answer section? Really, i can't correctly understand your idea. | |
| Sep 10, 2021 at 13:26 | answer | added | Gamow | timeline score: 2 | |
| Sep 10, 2021 at 10:07 | comment | added | ErroR | @JimN I edit my post. | |
| Sep 10, 2021 at 10:06 | history | edited | ErroR | CC BY-SA 4.0 |
added 171 characters in body
|
| Sep 10, 2021 at 7:47 | comment | added | JimN | Can you define "heaviest edges" in $C_1, C_2$ ? does this mean the sum of the one single largest edge in C1 and the one single largest edge in C2? Can you define what a 'cluster' is? Can $G$ be partitioned into any two $C_1$ and $C_2$? (So one could be a single edge and the other one be the rest of the graph?) Or do these partitions need to satisfy some other property to be considered a valid 'cluster' | |
| S Sep 9, 2021 at 15:39 | review | First questions | |||
| Sep 10, 2021 at 13:15 | |||||
| S Sep 9, 2021 at 15:39 | history | asked | ErroR | CC BY-SA 4.0 |