2487 search results - page 284 / 498 » Partitions of Graphs into Trees |
143
click to vote
COCOON
2003
Springer
15 years 8 months ago
2003
Springer
In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique c...
137
Voted
GD
1999
Springer
15 years 8 months ago
1999
Springer
The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. The graph is partitioned into a subgraph, its copy, and a remaind...
111
Voted
JCT
2008
15 years 3 months ago
2008
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max n 3 + (n - ) 3 = 1 2 + o...
124
Voted
TMI
2008
15 years 3 months ago
2008
Contrast-enhanced magnetic resonance imaging (MRI) is useful to study the infiltration of cells in vivo. This research adopts ultrasmall superparamagnetic iron oxide (USPIO) parti...
130
Voted
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
We consider the problem of clustering a collection of elements based on pairwise judgments of similarity and dissimilarity. Bansal, Blum and Chawla (in: Proceedings of 43rd FOCS, ...