553 search results - page 49 / 111 » Cover Contact Graphs |
APN
1999
Springer
15 years 2 months ago
1999
Springer
We show how the branching process approach can be used for the detection of illegal behaviors. Our study is based on the specification of properties in terms of testers that cover...
165
click to vote
MLQ
2011
14 years 5 months ago
2011
Given a graph G whose set of vertices is a Polish space X, the weak Borel chromatic number of G is the least size of a family of pairwise disjoint G-independent Borel sets that cov...
TCS
2008
14 years 10 months ago
2008
We investigate the role of the information available to the players on the outcome of the cops and robbers game. This game takes place on a graph and players move along the edges ...
102
click to vote
COMBINATORICS
2006
14 years 10 months ago
2006
Two sets are non-crossing if they are disjoint or one contains the other. The noncrossing graph NCn is the graph whose vertex set is the set of nonempty subsets of [n] = {1, . . ....
CSCLP
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...