653 search results - page 1 / 131 » The size of minimum 3-trees |
JGT
2007
13 years 8 months ago
2007
A 3-uniform hypergraph is called a minimum 3-tree, if for any 3-coloring of its vertex set there is a heterochromatic triple and the hypergraph has the minimum possible number of ...
JSAC
2011
12 years 11 months ago
2011
—The growth of real-time content streaming over the Internet has resulted in the use of peer-to-peer (P2P) approaches for scalable content delivery. In such P2P streaming systems...
JCT
2002
13 years 8 months ago
2002
CORR
2011
Springer
13 years 3 days ago
2011
Springer
1-- list of accepted papers with abstracts 1— LIST OF ACCEPTED PAPERS WITH ABSTRACTS (By submitted order)
JCO
2006
13 years 8 months ago
2006
A k-decomposition of a tree is a process in which the tree is recursively partitioned into k edge-disjoint subtrees until each subtree contains only one edge. We investigated the p...