3 votes 3 votes Please give some example regarding number of edges in dense graph is - |E| < |V2| I get that when we take log both sides we get O(ElogV), but I can't get this |E| < |V2| Algorithms algorithms graph-algorithms time-complexity + – iarnav asked Apr 21, 2018 • retagged Jul 7, 2022 by Lakshman Bhaiya iarnav 757 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 3 votes 3 votes we get relation logE= O(logV) abhishekmehta4u answered Apr 21, 2018 • selected Apr 21, 2018 by iarnav abhishekmehta4u comment Share Follow See all 2 Comments See all 2 2 Comments reply iarnav commented Apr 21, 2018 reply Follow Share You always have a pen and paper, handy! Awesome stuff @abhishekmehta4u @eyeamgj Thanks! :) 1 votes 1 votes hemanth_269 commented May 4, 2018 reply Follow Share LOG(E) != LOG(V) O(LOG(E)) = O(LOG(V)) 1 votes 1 votes Please log in or register to add a comment.
1 votes 1 votes the number of edges in a graph is less than or equal to (v(v-1))/2.......i.e number of edeges in complete graph with v vertices...so it will be |E|= O(V2 )........... eyeamgj answered Apr 21, 2018 eyeamgj comment Share Follow See all 0 reply Please log in or register to add a comment.