1101 search results - page 76 / 221 » An Algorithm for the Graph Crossing Number Problem |
152
click to vote
PODC
2006
ACM
15 years 10 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
146
click to vote
PVLDB
2010
15 years 3 months ago
2010
Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often to...
138
click to vote
JETAI
2008
15 years 4 months ago
2008
: This paper shows how the Asynchronous Backtracking (Yokoo et al., 1998) algorithm, a well known distributed constraint satisfaction algorithm, produces unnecessary messages and i...
171
click to vote
WADS
2007
Springer
15 years 11 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
143
click to vote
PAM
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Internet coordinate systems appear promising as a method for estimating network distance without direct measurement, allowing scalable configuration of emerging applicat...