146 search results - page 23 / 30 » Induced subgraphs of given sizes |
155
click to vote
CVPR
2011
IEEE
14 years 11 months ago
2011
IEEE
Active learning techniques have gained popularity in reducing human effort to annotate data instances for inducing a classifier. When faced with large quantities of unlabeled dat...
107
click to vote
WADS
2007
Springer
15 years 7 months ago
2007
Springer
Let (L, ∗) be a semilattice, and let c : L → [0, ∞) be monotone and increasing on L. We state the Minimum Join problem as: given size n sub-collection X of L and integer k w...
COMBINATORICA
2007
15 years 1 months ago
2007
The k-th power of a graph G is the graph whose vertex set is V (G)k , where two distinct ktuples are adjacent iff they are equal or adjacent in G in each coordinate. The Shannon ...
112
click to vote
STOC
2009
ACM
16 years 2 months ago
2009
ACM
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...
108
click to vote
JCSS
2010
15 years 5 days ago
2010
A subgraph T of a digraph D is an out-branching if T is an oriented spanning tree with only one vertex of in-degree zero (called the root). The vertices of T of out-degree zero ar...