Sciweavers

473 search results - page 5 / 95
» On stars and Steiner stars
Sort
View
DM
2002
116views more  DM 2002»
13 years 7 months ago
Star forests, dominating sets and Ramsey-type problems
A star forest of a graph G is a spanning subgraph of G in which each component is a star. The minimum number of edges required to guarantee that an arbitrary graph, or a bipartite...
Sheila Ferneyhough, Ruth Haas, Denis Hanson, Gary ...
TCS
2010
13 years 5 months ago
Adaptive star grammars and their languages
Motivated by applications that require mechanisms for describing the structure of object-oriented programs, adaptive star grammars are introduced, and their fundamental properties...
Frank Drewes, Berthold Hoffmann, Dirk Janssens, Ma...
IPPS
1998
IEEE
13 years 11 months ago
Multiprocessor Architectures Using Multi-Hop Multi-OPS Lightwave Networks and Distributed Control
Advances in optical technology have increased the interest for multiprocessor architectures based on lightwave networks because of the vast bandwidth available. In this paper we p...
David Coudert, Afonso Ferreira, Xavier Muño...
SMA
2010
ACM
206views Solid Modeling» more  SMA 2010»
13 years 5 months ago
A generalization for stable mixed finite elements
Mixed finite element methods solve a PDE involving two or more variables. In typical problems from electromagnetics and electrodiffusion, the degrees of freedom associated to the ...
Andrew Gillette, Chandrajit L. Bajaj
CORR
2010
Springer
64views Education» more  CORR 2010»
13 years 4 months ago
Dual Formulations of Mixed Finite Element Methods
Mixed finite element methods solve a PDE using two or more variables. The theory of Discrete Exterior Calculus explains why the degrees of freedom associated to the different varia...
Andrew Gillette, Chandrajit L. Bajaj