Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
JGT
2007
69views more  JGT 2007»
12 years 1 months ago
The size of minimum 3-trees
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 ...
Jorge L. Arocha, Joaquín Tey
ICALP
2004
Springer
12 years 7 months ago
Learning a Hidden Subgraph
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
Noga Alon, Vera Asodi
AAIM
2008
Springer
96views Algorithms» more  AAIM 2008»
12 years 8 months ago
Minimum Leaf Out-Branching Problems
Abstract. Given a digraph D, the Minimum Leaf Out-Branching problem (MinLOB) is the problem of ļ¬nding in D an out-branching with the minimum possible number of leaves, i.e., vert...
Gregory Gutin, Igor Razgon, Eun Jung Kim
books