1105 search results - page 138 / 221 » Linear choosability of graphs |
173
click to vote
COCOA
2007
Springer
16 years 2 days ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
158
click to vote
COLT
2007
Springer
16 years 2 days ago
2007
Springer
Property testing deals with tasks where the goal is to distinguish between the case that an object (e.g., function or graph) has a prespecified property (e.g., the function is li...
253
click to vote
ICPP
2006
IEEE
15 years 12 months ago
2006
IEEE
— This paper presents a parallel external-memory algorithm for performing a breadth-first traversal of an implicit graph on a cluster of workstations. The algorithm is a paralle...
154
click to vote
PODC
2005
ACM
15 years 11 months ago
2005
ACM
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
145
click to vote
APPROX
2005
Springer
15 years 11 months ago
2005
Springer
A caterpillar is a tree in which all vertices of degree three or more lie on one path, called the backbone. We present a polynomial time algorithm that produces a linear arrangeme...