Anda di halaman 1dari 1

ALGORITHM COMPLEXITY

Planar Graph Coloring


n-1
Number o in!ernal no"e#$%


m
i
i$&
A! ea'h in!ernal no"e O(mn) !ime i#
#pen! b* Ne+!,alue !o "e!ermine !he
'hil"ren
To!al !ime
n-1 n
%


m
i-1
n $%


m
i
n$O(nm
n
)
I$& i$1
.er!e+ 'o,er O(.-E)
Rabin /arp algori!hm 0
1or#! 'a#e- ((n-m-1)m)
A,erage 0O(n)-O(m-(.-n23)), i# ,ali"
#hi!
I 34$m an" .$O(1)
Then running !ime i# O(n-m)
Topologi'al 5or! (.-E)
N3ueen# O(n)
5um o #ub#e!- 6epen"# on number# an" 7eigh!#
Tra,elling #ale#per#on

(n
8
8
n
)
All pair# #hor!e#! pa!h O(n
9
)
Mul!i#!age Graph (:E:-:.:)
/ru#;al
(:E:log:E:)
Prim#
(n-:E:logn)

Anda mungkin juga menyukai