3008 search results - page 49 / 602 » Independence in connected graphs |
154
click to vote
FOCS
2006
IEEE
16 years 7 days ago
2006
IEEE
We study a switch Markov chain on regular graphs, where switches are allowed only between links that are at distance 3; we call this the Flip. The motivation for studying the Flip...
188
click to vote
JCO
2008
15 years 6 months ago
2008
Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
202
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
160
click to vote
ESA
2007
Springer
16 years 10 days ago
2007
Springer
Given a (directed or undirected) graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its n...
167
click to vote
SIGMOD
2010
ACM
15 years 10 months ago
2010
ACM
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...