Sciweavers

2487 search results - page 106 / 498
» Partitions of Graphs into Trees
Sort
View
IS
2010
13 years 8 months ago
Tree pattern mining with tree automata constraints
Most work on pattern mining focuses on simple data structures such as itemsets and sequences of itemsets. However, a lot of recent applications dealing with complex data like chem...
Sandra de Amo, Nyara A. Silva, Ronaldo P. Silva, F...
TAGT
1994
Springer
185views Graph Theory» more  TAGT 1994»
14 years 1 months ago
Concatenation of Graphs
An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a clas...
Joost Engelfriet, Jan Joris Vereijken
IPL
2007
114views more  IPL 2007»
13 years 9 months ago
Spanning trees with minimum weighted degrees
Given a metric graph G, we are concerned with finding a spanning tree of G where the maximum weighted degree of its vertices is minimum. In a metric graph (or its spanning tree),...
Mohammad Ghodsi, Hamid Mahini, Kian Mirjalali, Sha...
ICIP
2003
IEEE
14 years 11 months ago
Embedded wavelet region-based coding methods applied to digital mammography
In this paper, we investigate region-based embedded wavelet compression methods and introduce region-based extensions of the Set Partitioning In Hierarchical Trees (SPIHT) and the...
Monica Penedo, William A. Pearlman, Pablo G. Tahoc...
ADAEUROPE
2004
Springer
14 years 3 months ago
On the Tree Width of Ada Programs
The tree width of a graph G measures how close G is to being a tree or a series-parallel graph. Many well-known problems that are otherwise NP-complete can be solved efficiently if...
Bernd Burgstaller, Johann Blieberger, Bernhard Sch...