678 search results - page 1 / 136 » Structural Properties of Sparse Graphs |
ENDM
2008
13 years 10 months ago
2008
WWW
2008
ACM
14 years 11 months ago
2008
ACM
A large body of work has been devoted to identifying community structure in networks. A community is often though of as a set of nodes that has more connections between its member...
RSA
2008
13 years 10 months ago
2008
It is now known that many properties of the objects in certain combinatorial structures are equivalent, in the sense that any object possessing any of the properties must of neces...
IPCO
2008
14 years 9 days ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
ECCC
2008
13 years 11 months ago
2008
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...