1101 search results - page 166 / 221 » An Algorithm for the Graph Crossing Number Problem |
188
click to vote
SIGMOD
2009
ACM
16 years 2 months ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
117
click to vote
INFOCOM
2010
IEEE
15 years 13 days ago
2010
IEEE
Abstract—Wireless mesh networks are popular as a costeffective means to provide broadband connectivity to large user populations. A mesh network placement provides coverage, such...
130
click to vote
SAT
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We present a new method to break symmetry in graph coloring problems. While most alternative techniques add symmetry breaking predicates in a pre-processing step, we deve...
118
click to vote
CP
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
108
click to vote
FOCS
2002
IEEE
15 years 7 months ago
2002
IEEE
We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...