2487 search results - page 19 / 498 » Partitions of Graphs into Trees |
GFKL
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. The problem of clustering data can be formulated as a graph partitioning problem. In this setting, spectral methods for obtaining optimal solutions have received a lot of...
ICMCS
2000
IEEE
14 years 1 months ago
2000
IEEE
This paper deals with the creation of visual segment trees involved in MPEG-7 Description Schemes. After a brief overview of MPEG7 description schemes in general and of the Segmen...
ADC
2008
Springer
14 years 3 months ago
2008
Springer
Existing graph mining algorithms typically assume that the dataset can fit into main memory. As many large graph datasets cannot satisfy this condition, truly scalable graph minin...
ICMCS
2007
IEEE
14 years 3 months ago
2007
IEEE
In this paper, we present a graph-theoretic framework for provisioning overlay network based multimedia distribution services to a diverse set of receivers. Considering resource l...
FOCS
2008
IEEE
14 years 3 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...