Sciweavers

316 search results - page 6 / 64
» On almost self-complementary graphs
Sort
View
GD
2006
Springer
15 years 6 months ago
On the Crossing Number of Almost Planar Graphs
Petr Hlinený, Gelasio Salazar
113
Voted
FOCS
2010
IEEE
15 years 17 days ago
Hardness of Finding Independent Sets in Almost 3-Colorable Graphs
Irit Dinur, Subhash Khot, Will Perkins, Muli Safra
STOC
2000
ACM
112views Algorithms» more  STOC 2000»
15 years 7 months ago
A random graph model for massive graphs
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize ...
William Aiello, Fan R. K. Chung, Linyuan Lu