2487 search results - page 250 / 498 » Partitions of Graphs into Trees |
150
click to vote
JUCS
2010
15 years 2 months ago
2010
: River Formation Dynamics (RFD) is an evolutionary computation method based on copying how drops form rivers by eroding the ground and depositing sediments. Given a cost-evaluated...
144
Voted
ALT
2007
Springer
16 years 27 days ago
2007
Springer
We consider the problem of learning and verifying hidden graphs and their properties given query access to the graphs. We analyze various queries (edge detection, edge counting, sh...
113
Voted
ICDM
2008
IEEE
15 years 10 months ago
2008
IEEE
In graph mining, a frequency measure is anti-monotonic if the frequency of a pattern never exceeds the frequency of a subpattern. The efficiency and correctness of most graph pat...
145
click to vote
MFCS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
159
Voted
SDM
2008
SIAM
15 years 5 months ago
2008
SIAM
In constrained clustering it is common to model the pairwise constraints as edges on the graph of observations. Using results from graph theory, we analyze such constraint graphs ...