332 search results - page 51 / 67 » Parameterized Graph Separation Problems |
120
click to vote
SWAT
2010
Springer
15 years 4 months ago
2010
Springer
Given a permutation π of {1, . . . , n} and a positive integer k, we give an algorithm with running time 2O(k2 log k) nO(1) that decides whether π can be partitioned into at mos...
104
click to vote
DEXA
2010
Springer
14 years 12 months ago
2010
Springer
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
FOCS
2004
IEEE
15 years 3 months ago
2004
IEEE
The Metric Labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. The input to the problem consists of a set of labels a...
122
click to vote
ISSTA
2012
ACM
13 years 2 months ago
2012
ACM
To keep a Graphical User Interface (GUI) responsive and active, a GUI application often has a main UI thread (or event dispatching thread) and spawns separate threads to handle le...
ICDCS
2006
IEEE
15 years 5 months ago
2006
IEEE
This paper studies compact routing schemes for networks with low doubling dimension. Two variants are explored, name-independent routing and labeled routing. The key results obtai...