Login / Signup
Solving Planar k -Terminal Cut in $O(n^{c \sqrt{k}})$ Time.
Philip N. Klein
Dániel Marx
Published in:
ICALP (1) (2012)
Keyphrases
</>
combinatorial optimization
planar graphs
lower bound
worst case
database
information systems
np complete
timetabling problem