Sciweavers

151 search results - page 19 / 31
» Hyperbolic Graphs of Small Complexity
Sort
View
ESA
2006
Springer
137views Algorithms» more  ESA 2006»
14 years 1 months ago
Deciding Relaxed Two-Colorability - A Hardness Jump
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
Robert Berke, Tibor Szabó
COMPLEX
2009
Springer
14 years 4 months ago
Synchronization Stability of Coupled Near-Identical Oscillator Network
We derive variational equations to analyze the stability of synchronization for coupled near-identical oscillators. To study the effect of parameter mismatch on the stability in a ...
Jie Sun, Erik M. Bollt, Takashi Nishikawa
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
13 years 11 months ago
On the approximability of influence in social networks
In this paper, we study the spread of influence through a social network, in a model initially studied by Kempe, Kleinberg and Tardos [14, 15]: We are given a graph modeling a soc...
Ning Chen
GG
2010
Springer
13 years 11 months ago
Multi-Amalgamation in Adhesive Categories
Abstract. Amalgamation is a well-known concept for graph transformations in order to model synchronized parallelism of rules with shared subrules and corresponding transformations....
Ulrike Golas, Hartmut Ehrig, Annegret Habel
CORR
2008
Springer
97views Education» more  CORR 2008»
13 years 10 months ago
Lower bounds for adaptive linearity tests
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
Shachar Lovett