Sciweavers

1952 search results - page 132 / 391
» Complete partitions of graphs
Sort
View
DATE
2000
IEEE
139views Hardware» more  DATE 2000»
15 years 9 months ago
Target Architecture Oriented High-Level Synthesis for Multi-FPGA Based Emulation
This paper presents a new approach on combined highlevel synthesis and partitioning for FPGA-based multi-chip emulation systems. The goal is to synthesize a prototype with maximal...
Oliver Bringmann, Wolfgang Rosenstiel, Carsten Men...
LFCS
2009
Springer
15 years 11 months ago
Positive Fork Graph Calculus
We introduce and illustrate a graph calculus for proving and deciding the positive identities and inclusions of fork algebras, i.e., those without occurrences of complementation. ...
Renata P. de Freitas, Sheila R. M. Veloso, Paulo A...
ENDM
2007
114views more  ENDM 2007»
15 years 4 months ago
The Connectivity of addition Cayley graphs
For any finite abelian group G and any subset S ⊆ G, we determine the connectivity of the addition Cayley graph induced by S on G. Moreover, we show that if this graph is not c...
David J. Grynkiewicz, Vsevolod F. Lev, Oriol Serra
ENTCS
2007
101views more  ENTCS 2007»
15 years 4 months ago
Inequational Deduction as Term Graph Rewriting
Multi-algebras allow to model nondeterminism in an algebraic framework by interpreting operators as functions from individual arguments to sets of possible results. We propose a s...
Andrea Corradini, Fabio Gadducci, Wolfram Kahl, Ba...
CORR
2010
Springer
73views Education» more  CORR 2010»
15 years 4 months ago
On Touching Triangle Graphs
Abstract. In this paper, we consider the problem of representing graphs by triangles whose sides touch. We present linear time algorithms for creating touching triangles representa...
Emden R. Gansner, Yifan Hu, Stephen G. Kobourov