406 search results - page 21 / 82 » Dominating Sets in Web Graphs |
DM
2002
13 years 8 months ago
2002
Let ir(G) and (G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H) = (H), for every induced subgr...
DATE
2007
IEEE
14 years 3 months ago
2007
IEEE
This paper proposes a novel algorithm that, given a data-flow graph and an input/output constraint, enumerates all convex subgraphs under the given constraint in polynomial time ...
ICALP
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with respectively nA and nB vertices. We define a nA × nB...
IWPEC
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...
CVPR
2003
IEEE
14 years 2 months ago
2003
IEEE
We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitiv...