Sciweavers

2283 search results - page 66 / 457
» Bounds of Graph Characteristics
Sort
View
MP
2010
149views more  MP 2010»
13 years 6 months ago
Copositive programming motivated bounds on the stability and the chromatic numbers
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...
Igor Dukanovic, Franz Rendl
SDM
2009
SIAM
104views Data Mining» more  SDM 2009»
14 years 5 months ago
On Randomness Measures for Social Networks.
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...
Xiaowei Ying, Xintao Wu
STACS
2007
Springer
14 years 2 months ago
Compact Forbidden-Set Routing
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...
Bruno Courcelle, Andrew Twigg
FOCS
2008
IEEE
14 years 2 months ago
Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums
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...
Amit Chakrabarti, Alexander Jaffe, James R. Lee, J...
TPCTC
2010
Springer
149views Hardware» more  TPCTC 2010»
13 years 5 months ago
A Discussion on the Design of Graph Database Benchmarks
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...
David Dominguez-Sal, Norbert Martínez-Bazan...