2283 search results - page 66 / 457 » Bounds of Graph Characteristics |
151
Voted
MP
2010
15 years 1 months ago
2010
The Lov´asz theta number of a graph G can be viewed as a semidefinite programming relaxation of the stability number of G. It has recently been shown that a copositive strengthe...
112
Voted
SDM
2009
SIAM
16 years 17 days ago
2009
SIAM
Social networks tend to contain some amount of randomness and some amount of non-randomness. The amount of randomness versus non-randomness affects the properties of a social netw...
121
click to vote
STACS
2007
Springer
15 years 9 months ago
2007
Springer
We study the following problem. Given a weighted planar graph G, assign labels L(v) to vertices so that given L(u), L(v) and L(x) for x ∈ X for any X ⊂ V (G), compute the dist...
129
click to vote
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...
114
click to vote
TPCTC
2010
Springer
15 years 1 months ago
2010
Springer
Graph Database Management systems (GDBs) are gaining popularity. They are used to analyze huge graph datasets that are naturally appearing in many application areas to model interr...