HackerTrans
TopNewTrendsCommentsPastAskShowJobs

graphcolorer

no profile record

comments

graphcolorer
·5 bulan yang lalu·discuss
I like this part very much:

More than three years after this episode took place, Terence, still a little boy, happily played hide and seek with his two younger brothers when the Tao family visited the Clements household. He is a happy, well-mannered lad who obviously loves and respects his parents and his two brothers. He gets on well with others, too. Mr John Fidge, his Year 11 Mathematics teacher at Blackwood High School for the first two terms of 1983, told me that after he had been attending the Year 11 Mathematics classes for about a fortnight he was accepted as just another member of the class. He is always willing to volunteer answers to questions asked by his teachers and was regarded as a friendly, humble, but very bright boy by his classmates.
graphcolorer
·tahun lalu·discuss
An important character in the great Hindu epic, the Mahabharata, likely had this condition. She was the great-grandmother of the Pandavas and Kauravas and her name was Satyavati. She was also known as Matsyagandhi ("fish-fragrant").
graphcolorer
·3 tahun yang lalu·discuss
[flagged]
graphcolorer
·5 tahun yang lalu·discuss
No, though nodes can be deleted -- at a cost equal to the total cost of all the edges that contain it.
graphcolorer
·5 tahun yang lalu·discuss
That's what I'm doing now, but the results aren't great. If there's a way to estimate a lower bound on the number of edges to remove, I can figure out if the results aren't great because of the approximation, or because of the nature of the graph...
graphcolorer
·5 tahun yang lalu·discuss
Can take as long as needed as it only needs to be colored one time. About 10,000 nodes, reasonably dense (about half the nodes will have 1,000+ edges).
graphcolorer
·5 tahun yang lalu·discuss
One time.
graphcolorer
·5 tahun yang lalu·discuss
I have a graph with weighted edges. I want to remove edges to make the graph colorable with N colors (e.g. N=40) such that the total weight of removed edges is minimized. If I'm able to solve this problem, that will complete a project I've been working on for years now to make a working keyboard for a person I know that has cerebral palsy.