Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
4,786
New Bounds on the Size of the Minimum Feedback Vertex Set in Meshes and Butterflies
- In Proc. 8th International Colloquium on Structural Information and Communication Complexity (SIROCCO '01
, 2001
"... Given a graph G= (V ..."
LogP: Towards a Realistic Model of Parallel Computation
, 1993
"... A vast body of theoretical research has focused either on overly simplistic models of parallel computation, notably the PRAM, or overly specific models that have few representatives in the real world. Both kinds of models encourage exploitation of formal loopholes, rather than rewarding developme ..."
Abstract
-
Cited by 562 (15 self)
- Add to MetaCart
development of techniques that yield performance across a range of current and future parallel machines. This paper offers a new parallel machine model, called LogP, that reflects the critical technology trends underlying parallel computers. It is intended to serve as a basis for developing fast, portable
The Landscape of Parallel Computing Research: A View from Berkeley
- TECHNICAL REPORT, UC BERKELEY
, 2006
"... ..."
Lower Bounds to the Size of the Minimum Feedback Vertex Sets in Split-stars ∗
"... In a graph G = (V, E), a subset F ⊂ V (G) is a feedback vertex set of G if the subgraph induced by V (G) \ F is acyclic. In this paper, we establish a lower bound to the size of the minimum feedback vertex sets in split-stars. 1 ..."
Abstract
- Add to MetaCart
In a graph G = (V, E), a subset F ⊂ V (G) is a feedback vertex set of G if the subgraph induced by V (G) \ F is acyclic. In this paper, we establish a lower bound to the size of the minimum feedback vertex sets in split-stars. 1
Bounds for Minimum Feedback Vertex Sets in Distance Graphs and Circulant Graphs
"... For a set D ⊂ Zn, the distance graph Pn(D) has Zn as its vertex set and the edges are between vertices i and j with |i − j | ∈ D. The circulant graph Cn(D) is defined analogously by considering operations modulo n. The minimum feedback vertex set problem consists in finding the smallest number of v ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
For a set D ⊂ Zn, the distance graph Pn(D) has Zn as its vertex set and the edges are between vertices i and j with |i − j | ∈ D. The circulant graph Cn(D) is defined analogously by considering operations modulo n. The minimum feedback vertex set problem consists in finding the smallest number
Minimum feedback vertex sets in shuffle-based interconnection networks
- Inform. Process. Lett
, 2003
"... Given a graph G, the problem is to construct a smallest subset S of vertices whose deletion results in an acyclic subgraph. The set S is called a minimum feedback vertex set for G. Tight upper and lower bounds on the cardinality of minimum feedback vertex sets have been obtained for some hypercube–l ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
–like networks, such as meshes, tori, butterflies, cube-connected cycles and hypercubes. In this paper we construct minimum feedback vertex sets and determine their cardinalities in certain shuffle-based interconnection networks, such as shuffle-exchange, de Bruijn and Kautz networks.
Normal Meshes
, 2000
"... Normal meshes are new fundamental surface descriptions inspired by differential geometry. A normal mesh is a multiresolution mesh where each level can be written as a normal offset from a coarser version. Hence the mesh can be stored with a single float per vertex. We present an algorithm to approxi ..."
Abstract
-
Cited by 150 (9 self)
- Add to MetaCart
Normal meshes are new fundamental surface descriptions inspired by differential geometry. A normal mesh is a multiresolution mesh where each level can be written as a normal offset from a coarser version. Hence the mesh can be stored with a single float per vertex. We present an algorithm
Results 1 - 10
of
4,786
