1,575 reputation
1024
bio website pratikdeoghare.github.com
location India
age
visits member for 4 years, 2 months
seen 2 hours ago

Aug
20
comment Partition planar graph into connected subgraphs of equal size
I see. This makes the question very interesting. +1
Aug
19
comment Partition planar graph into connected subgraphs of equal size
Compute planer embedding. Run some kind of sweep line algorithm. Once sweep line hits n/r vertices cut the edges connecting to the rest of the graph. This should work for planer graphs.
Jun
11
comment What does research in theoretical computer science involve?
It involves "...pounding your head against the wall for a long time...". Read more Bob Tarjan interview.
Jun
2
comment Intersection of two unsorted sets or lists
Related question stackoverflow.com/q/8102478/58737
May
13
comment What should I read to learn about the different models of computation used in algorithm and especially data structure analysis?
Beyond worst case analysis.
Dec
28
comment Can one automate algorithmic analysis?
When I was young and naive I tried to write complexity analyzer using gcov. It gives you number of times each line was executed. :) Good question!
Dec
18
comment Graph partitioning by node deletion
Graph separators where $B = \varepsilon n$?
Dec
7
comment What is this notation style called?
See here1 and Backus-Naur form.
Jul
22
comment Finding Tours through Near-Hamiltonian Paths?
Do you mean you are allowed to visit a vertex twice if necessary? @Kaveh but if the graph is is directed then its not always possible even if its connected.
Jul
18
comment Integer roots of a polynomial
This might help. Note: I just know the words "Grobner basis" and have almost no idea of what they mean. So I am probably wrong. :)
Jun
1
comment An algorithm for calculating the probability of a disease spreading through a graph
Infectious Random Walks.
Apr
10
comment Witnesses for mathematical software
You might want to take a look at Certifying Algorithms.
Jan
11
comment Why can machine learning not recognize prime numbers?
It can. But in machine learning we want to minimize error on testing dataset. Now, if you train on $[1, 20]$ you might end up learning $f(n) = n^2 - n + 41$ and which works perfectly for numbers less that $41$. But after that its performance is no good. People have tried this(manually :-) ) and so far without much success. In ML we try to find patterns but what if there isn't any pattern?
Nov
19
comment Algorithms Design and Complexity - How to think in that 'way'?
1. Learn how to program. 2. Participate in programming competitions.
Nov
5
comment Can any program be implemented mechanically?
Yes sir!
Apr
18
comment Implementation of Wilf-Zeilberger and related methods
Try mailing Doron Zeilberger he codes. here.
Mar
14
comment Application of calculus in computer science
@JɛffE Very good question sir! :)
Mar
11
comment What is some important work in fractals?
and for travelling salesman problem.
Feb
25
comment Concepts in theoretical CS that would be approachable ages 8-14
@vzn Some guy developed this video link
Feb
1
comment Advantages and specific applications of massively parallel programming thesis idea
Try cracking md5 :)