214 search results - page 14 / 43 » Note on Sparse Random Graphs and Cover Graphs |
267
Voted
COMPGEOM
2011
ACM
14 years 6 months ago
2011
ACM
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
142
Voted
TCS
2008
15 years 2 months ago
2008
Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of ...
108
Voted
INFOCOM
2003
IEEE
15 years 8 months ago
2003
IEEE
— Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute-like methods have led s...
107
Voted
SIAMDM
2008
15 years 2 months ago
2008
In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph Kn with n 2ck contains a K4 whose edges receive at most two colors. Th...
161
Voted
CORR
2011
Springer
14 years 9 months ago
2011
Springer
Scaling up the sparse matrix-vector multiplication kernel on modern Graphics Processing Units (GPU) has been at the heart of numerous studies in both academia and industry. In thi...