2487 search results - page 187 / 498 » Partitions of Graphs into Trees |
135
Voted
DAM
2006
15 years 3 months ago
2006
Abstract. Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorith...
139
click to vote
COMBINATORICS
2004
15 years 3 months ago
2004
The set of all orientations of a planar graph with prescribed outdegrees carries the structure of a distributive lattice. This general theorem is proven in the first part of the p...
145
Voted
ICMCS
2005
IEEE
15 years 9 months ago
2005
IEEE
In this paper, a method for content-based retrieval of JPEG images is presented, utilizing features directly from the discrete cosine transform (DCT) domain. Image indexing is ach...
128
Voted
ALGORITHMICA
2010
15 years 3 months ago
2010
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
162
Voted
ECML
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Constrained clustering investigates how to incorporate domain knowledge in the clustering process. The domain knowledge takes the form of constraints that must hold on th...