1274 search results - page 41 / 255 » Graph lambda theories |
145
click to vote
STOC
2002
ACM
16 years 4 months ago
2002
ACM
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
157
click to vote
IWOCA
2010
Springer
14 years 11 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...
128
click to vote
SECURWARE
2008
IEEE
15 years 10 months ago
2008
IEEE
Trust network analysis with subjective logic (TNA-SL) simplifies complex trust graphs into series-parallel graphs by removing the most uncertain paths to obtain a canonical graph...
131
click to vote
VISSOFT
2005
IEEE
15 years 10 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 ...
140
click to vote
PODC
2006
ACM
15 years 10 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...