803 search results - page 45 / 161 » Independence in Direct-Product Graphs |
97
Voted
ESWS
2008
Springer
15 years 2 months ago
2008
Springer
A fundamental problem related to graph structured databases is searching for substructures. One issue with respect to optimizing such searches is the ability to estimate the freque...
100
Voted
DM
2006
15 years 21 days ago
2006
Let n(G) denote the number of vertices of a graph G and let (G) be the independence number of G, the maximum number of pairwise nonadjacent vertices of G. The Hall ratio of a grap...
ISAAC
2007
Springer
15 years 6 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...
108
click to vote
ICALP
2001
Springer
15 years 5 months ago
2001
Springer
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
SIAMCOMP
1998
15 years 9 days ago
1998
This paper first presents a unified approach to design efficient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected,...