Sciweavers

328 search results - page 16 / 66
» Graph Algebras for Bigraphs
Sort
View
DM
2006
78views more  DM 2006»
15 years 4 months ago
On polynomial digraphs
Let (x, y) be a bivariate polynomial with complex coefficients. The zeroes of (x, y) are given a combinatorial structure by considering them as arcs of a directed graph G(). This p...
Josep M. Brunat, Antonio Montes
SIAMDM
2000
103views more  SIAMDM 2000»
15 years 4 months ago
Directional Routing via Generalized st-Numberings
We present a mathematical model for network routing based on generating paths in a consistent direction. Our development is based on an algebraic and geometric framework for defini...
Fred S. Annexstein, Kenneth A. Berman
DM
2010
79views more  DM 2010»
15 years 4 months ago
Algebraic connectivity for vertex-deleted subgraphs, and a notion of vertex centrality
Let G be a connected graph, suppose that v is a vertex of G, and denote the subgraph formed from G by deleting vertex v by G \ v. Denote the algebraic connectivities of G and G \ ...
Steve Kirkland
WG
2005
Springer
15 years 10 months ago
Algebraic Operations on PQ Trees and Modular Decomposition Trees
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...
Ross M. McConnell, Fabien de Montgolfier
EPEW
2008
Springer
15 years 6 months ago
Assembly Code Analysis Using Stochastic Process Algebra
Currently compilers contain a large number of optimisations which are based on a set of heuristics that are not guaranteed to be effective to improve the performance metrics. In th...
Lamia Djoudi, Leïla Kloul