1199 search results - page 26 / 240 » Graph Theory |
111
Voted
VISSOFT
2005
IEEE
15 years 8 months ago
2005
IEEE
Dominance analysis from graph theory allows one to locate subordinated software elements in a rooted dependency graph. It identifies the nesting structure for a dependency graph ...
108
click to vote
CP
2008
Springer
15 years 4 months ago
2008
Springer
By using recent results from graph theory, including the Strong Perfect Graph Theorem, we obtain a unifying framework for a number of tractable classes of constraint problems. Thes...
123
Voted
PODC
2006
ACM
15 years 8 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
132
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We introduce a general stochastic model for the spread of rumours, and derive mean-field equations that describe the dynamics of the model on complex social networks (in particula...
134
click to vote
IWOCA
2010
Springer
14 years 9 months ago
2010
Springer
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...