496 search results - page 49 / 100 » C4-saturated bipartite graphs |
DM
2008
13 years 7 months ago
2008
Let G = (V, E) be a graph. A set S V is a restrained dominating set if every vertex not in S is adjacent to a vertex in S and to a vertex in V - S. The restrained domination numb...
DCG
2011
13 years 2 months ago
2011
We examine the generic local and global rigidity of various graphs in Rd . Bruce Hendrickson showed that some necessary conditions for generic global rigidity are (d + 1)-connected...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Given a graph G = (V, E) and a positive integer k, the Proper Interval Completion problem asks whether there exists a set F of at most k pairs of (V × V ) \ E such that the graph...
ICPR
2010
IEEE
13 years 12 months ago
2010
IEEE
Semantic analysis of a document collection can be viewed as an unsupervised clustering of the constituent words and documents around hidden or latent concepts. This has shown to i...
IS
2008
13 years 7 months ago
2008
In spatial networks, clustering adjacent data to disk pages is highly likely to reduce the number of disk page accesses made by the aggregate network operations during query proce...