1 citations · 2 across the 8 of their papers we have counts for
Showing 2010Show all
3 papers · 1 filter
math.CO2010
Dense graphs with a large triangle cover have a large triangle packing
Raphael Yuster
It is well known that a graph with edges can be made triangle-free by removing (slightly less than) edges. On the other hand, there are many classes of graphs which are h…
cs.CC2010
Two-phase algorithms for the parametric shortest path problem
Eldar Fischer, Oded Lachish, Raphael Yuster
A {\em parametric weighted graph} is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obtains…
math.CO2010★ 1 cited
The Quasi-Randomness of Hypergraph Cut Properties
Asaf Shapira, Raphael Yuster
Let a_1,...,a_k satisfy a_1+...+a_k=1 and suppose a k-uniform hypergraph on n vertices satisfies the following property; in any partition of its vertices into k sets A_1,...,A_k of…