1933 search results - page 88 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
222
Voted
WAOA
2010
Springer
15 years 1 months ago
2010
Springer
We study the problem of producing a global ranking of items given pairwise ranking information, when the items to be ranked arrive in an online fashion. We study both the maximizat...
127
click to vote
WADS
2005
Springer
15 years 9 months ago
2005
Springer
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
128
Voted
PODC
2009
ACM
16 years 4 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
99
Voted
SODA
2010
ACM
16 years 27 days ago
2010
ACM
Many combinatorial problems--such as the traveling salesman, feedback arcset, cutwidth, and treewidth problem-can be formulated as finding a feasible permutation of n elements. Ty...
135
Voted
ISCAS
2003
IEEE
15 years 8 months ago
2003
IEEE
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...