[algogeeks] BCBGC-08 Call for papers

*Apologies if you receive multiple copies. Please forward to interested people* The 2008 International Conference on Bioinformatics, Computational Biology, Genomics and Chemoinformatics (BCBGC-08) (website: www.PromoteResearch.org) will be held during July 7-10 2

[algogeeks] Re: coloring a graph of O(|V|) edges

Say the graph can be colored with minimum k different color. Then there exists at least one edge between every pair of different colored vertex group. So E>=k*(k-1)/2 ==> k < O(sqrt(E)) = O (V^1/2) On 10/22/07, [EMAIL PROTECTED] <[EMAIL PROTECTED]> wrote: > > > Hi, > >Can some provide me

[algogeeks] Re: min height rootless tree

Another approach can be to eliminate leaf nodes iteratively from tree. At last only root node or nodes on same level will be left. Adjency list representation of graph will make it easier to imlplement. Run time cost will be O(n*n) On Oct 24, 12:37 pm, "[EMAIL PROTECTED]" <[EMAIL PROTECTED]> wr

[algogeeks] Re: min height rootless tree

Two methods: 1. try BFS on each vertex, calculate the longest shortest path to each other vertex, compare them It is easy to implement, but gives O(n*n) running time 2. divide and conquer randomly divide the tree into two parts, calculate the height of the two subtrees then merge them

[algogeeks] Re: coloring a graph of O(|V|) edges

In fact, we could use only 3 colors to do this, if this graph is connected. At first, I guess you know the famous 4-color theorem, so 4 colors is enough. In fact, if this graph can be disconnected, then we have to use 4 colors. But if it is connected, then it is a tree plus one extra edge, which

[algogeeks] Re: How calculate time complexity of algorithms related with output size?

One of these algorithms I encountered is the Sweeping Line Algorithm, which is quite useful in computational geometry. For this algorithm, input is n points, running time will be sometimes sensitive to the output. For example, if we want to calculate all the intersections of n segments, worst case

[algogeeks] RAYLOGIX TECHNOLOGIES PROVIDES LIVE PROJECTS FOR THE FINAL YEAR STUDENTS(CSE & ISE)

RAYLOGIX TECHNOLOGIES Software Development centre Offers through their Group of companies Live Projects for B.E,MCA, BCA,MSc,M.TECH (CS & IT) Students Benefits to the students: - Excellent training from Industry Experienced Experts - Employable Soft-skills - Guaranteed Placement Support Contact