Sciweavers

4 search results - page 1 / 1
» Fractional Decompositions of Dense Hypergraphs
Sort
View
86
Voted
APPROX
2005
Springer
93views Algorithms» more  APPROX 2005»
15 years 6 months ago
Fractional Decompositions of Dense Hypergraphs
Raphael Yuster
91
Voted
TALG
2010
110views more  TALG 2010»
14 years 11 months ago
Approximating fractional hypertree width
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
Dániel Marx
111
Voted
FOCS
2006
IEEE
15 years 4 months ago
Witnesses for non-satisfiability of dense random 3CNF formulas
We consider random 3CNF formulas with n variables and m clauses. It is well known that when m > cn (for a sufficiently large constant c), most formulas are not satisfiable. How...
Uriel Feige, Jeong Han Kim, Eran Ofek
115
Voted
AIRWEB
2009
Springer
15 years 7 months ago
Tag spam creates large non-giant connected components
Spammers in social bookmarking systems try to mimick bookmarking behaviour of real users to gain the attention of other users or search engines. Several methods have been proposed...
Nicolas Neubauer, Robert Wetzker, Klaus Obermayer