16 search results - page 1 / 4 » A new proof of the graph removal lemma |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
STOC
2009
ACM
14 years 5 days ago
2009
ACM
A system of linear equations in p unknowns Mx = b is said to have the removal property if every set S ⊆ {1, . . . , n} which contains o(np− ) solutions of Mx = b can be turned...
FOCS
2009
IEEE
14 years 3 days ago
2009
IEEE
— We present new combinatorial algorithms for Boolean matrix multiplication (BMM) and preprocessing a graph to answer independent set queries. We give the first asymptotic impro...
JCT
2007
13 years 5 months ago
2007
An edge in a drawing of a graph is called even if it intersects every other edge of the graph an even number of times. Pach and T´oth proved that a graph can always be redrawn so...
ACSC
2003
IEEE
13 years 10 months ago
2003
IEEE
Graphs where each node includes an amount of text are often used in applications. A typical example of such graphs is UML diagrams used in CASE tools. To make text information in ...