6 search results - page 1 / 2 » Evasiveness of Subgraph Containment and Related Properties |
168
click to vote
STACS
2001
Springer
15 years 10 months ago
2001
Springer
We prove new results on evasiveness of monotone graph properties by extending the techniques of Kahn, Saks, and Sturtevant [Combinatorica, 4 (1984), pp. 297–306]. For the propert...
139
click to vote
ISAAC
2007
Springer
15 years 12 months ago
2007
Springer
In an edge deletion problem one is asked to delete at most k edges from a given graph such that the resulting graph satisfies a certain property. In this work, we study four NP-co...
194
click to vote
DM
2011
15 years 24 days ago
2011
Let G be the set of finite graphs whose vertices belong to some fixed countable set, and let ≡ be an equivalence relation on G. By the strengthening of ≡ we mean an equivalen...
193
click to vote
ALT
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Assume we are given a sample of points from some underlying distribution which contains several distinct clusters. Our goal is to construct a neighborhood graph on the sa...
166
click to vote
SDM
2008
SIAM
15 years 7 months ago
2008
SIAM
The rigid all-versus-all adjacency required by a maximal biclique for its two vertex sets is extremely vulnerable to missing data. In the past, several types of quasi-bicliques ha...