201 search results - page 18 / 41 » The Connectivity of addition Cayley graphs |
JCO
2010
13 years 5 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
PDP
2005
IEEE
14 years 29 days ago
2005
IEEE
Circulant graphs have been deeply studied in technical literature. Midimew networks are a class of distancerelated optimal circulant graphs of degree four which have applications ...
RTA
2009
Springer
14 years 1 months ago
2009
Springer
We address the problem of cyclic termgraph rewriting. We propose a new framework where rewrite rules are tuples of the form (L, R, τ, σ) such that L and R are termgraphs represen...
TPCG
2003
IEEE
14 years 20 days ago
2003
IEEE
In many application areas an optimal visualization of a complex graph depends on the specific task to be accomplished by the user. Therefore a means of locally customizable layou...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We address the problem of cyclic termgraph rewriting. We propose a new framework where rewrite rules are tuples of the form (L, R, , ) such that L and R are termgraphs representing...