677 search results - page 67 / 136 » Bipartite roots of graphs |
ICDM
2008
IEEE
14 years 5 months ago
2008
IEEE
Nonnegative matrix factorization (NMF) is a versatile model for data clustering. In this paper, we propose several NMF inspired algorithms to solve different data mining problems....
DM
2008
13 years 11 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 6 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
13 years 2 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...
ICALP
2011
Springer
13 years 2 months ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...