256 search results - page 8 / 52 » Application-Only Call Graph Construction |
JCT
2006
13 years 9 months ago
2006
We construct a polynomial-time algorithm to approximate the branch-width of certain symmetric submodular functions, and give two applications. The first is to graph "clique-wi...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the subm...
EJC
2008
13 years 10 months ago
2008
Tension-continuous (shortly TT) mappings are mappings between the edge sets of graphs. They generalize graph homomorphisms. From another perspective, tension-continuous mappings a...
COMBINATORICS
2006
13 years 9 months ago
2006
We associate one or two posets (which we call "semistandard posets") to any given irreducible representation of a rank two semisimple Lie algebra over C. Elsewhere we ha...
ISCIS
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Given a set of observations of an existing concurrent system with repetitive sub-functions, we consider the construction of an MSC graph representing the functionality of...