1027 search results - page 56 / 206 » Ordered Vertex Partitioning |
172
click to vote
APPROX
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
129
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
In order to protect an image search engine's users from undesirable results adult images' classifier should be built. The information about links from websites to images...
151
click to vote
JCO
2007
15 years 5 months ago
2007
In a graph G, a vertex dominates itself and its neighbors. A subset S ⊆ V (G) is an m-tuple dominating set if S dominates every vertex of G at least m times, and an m-dominating...
139
click to vote
TCS
2010
15 years 3 days ago
2010
Abstract. A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white ve...
138
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
In this paper we initiate the study of the AND-OR directed feedback vertex set problem from the viewpoint of approximation algorithms. This AND-OR feedback vertex set problem is m...