Sciweavers

684 search results - page 56 / 137
» A characterization of b-perfect graphs
Sort
View
101
Voted
COMBINATORICS
2002
87views more  COMBINATORICS 2002»
15 years 1 months ago
Map Genus, Forbidden Maps, and Monadic Second-Order Logic
A map is a graph equipped with a circular order of edges around each vertex. These circular orders represent local planar embeddings. The genus of a map is the minimal genus of an...
Bruno Courcelle, V. Dussaux
CSCWD
2007
Springer
15 years 8 months ago
An interactive graph visualization for handling cooperative design activity context
The context of a collective activity is characterized by all information produced during the activity. The comprehension of this context by each actor is essential for the success...
Gilles Halin
111
Voted
JPDC
2000
106views more  JPDC 2000»
15 years 1 months ago
Dual of a Complete Graph as an Interconnection Network
A new class of interconnection networks, the hypernetworks, has been proposed recently. Hypernetworks are characterized by hypergraphs. Compared with point-to-point networks, they...
Si-Qing Zheng, Jie Wu
CASES
2010
ACM
14 years 10 months ago
Optimizing energy to minimize errors in dataflow graphs using approximate adders
Approximate arithmetic is a promising, new approach to lowenergy designs while tackling reliability issues. We present a method to optimally distribute a given energy budget among...
Zvi M. Kedem, Vincent John Mooney, Kirthi Krishna ...
DATE
2009
IEEE
120views Hardware» more  DATE 2009»
15 years 8 months ago
Optimizing data flow graphs to minimize hardware implementation
Abstract - This paper describes an efficient graphbased method to optimize data-flow expressions for best hardware implementation. The method is based on factorization, common su...
Daniel Gomez-Prado, Q. Ren, Maciej J. Ciesielski, ...