721 search results - page 31 / 145 » Bounds on the k-domination number of a graph |
112
click to vote
AI
2010
Springer
15 years 2 months ago
2010
Springer
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
129
click to vote
FSTTCS
2009
Springer
15 years 6 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
108
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
For an acyclic directed graph with multiple sources and multiple sinks, we prove that one can choose the Menger's paths between the sources and the sinks such that the number...
126
click to vote
CORR
2012
Springer
13 years 9 months ago
2012
Springer
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
129
click to vote
DM
1999
15 years 1 months ago
1999
A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canon...