recategorized by
264 views
0 votes
0 votes
closed with the note: Solved!

I've read somewhere, but can't find any credible source or someone to attest it. So, please let me know, how this is True - 

Question - In terms of complexities in simple graph -

Vertices in simple graph - O(log E)

Edges in simple graph - O(V2)

recategorized by

Related questions

0 votes
0 votes
0 answers
1
BHASHKAR asked Jan 5, 2019
716 views
why in this planar graph this theorem ,”sum of degrees of faces or regions is twice the number of edges” is not true as it should hold for all planar graphs??Note: nu...
2 votes
2 votes
0 answers
2
1 votes
1 votes
1 answer
3