1027 search results - page 145 / 206 » Ordered Vertex Partitioning |
IPM
2006
13 years 8 months ago
2006
We consider a challenging clustering task: the clustering of muti-word terms without document co-occurrence information in order to form coherent groups of topics. For this task, ...
ICRA
2010
IEEE
13 years 7 months ago
2010
IEEE
— Skid-steered vehicles, by design, must skid in order to maneuver. The skidding causes the vehicle to behave discontinuously as well as introduces complications to the observati...
ICALP
2009
Springer
14 years 9 months ago
2009
Springer
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
WADS
2009
Springer
14 years 3 months ago
2009
Springer
We present the first thorough theoretical analysis of the Transitivity Editing problem on digraphs. Herein, the task is to perform a minimum number of arc insertions or deletions ...