𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Structural reducts and the full implies strong problem

✍ Scribed by Todd Niven

Publisher
Springer
Year
2007
Tongue
English
Weight
123 KB
Volume
57
Category
Article
ISSN
0002-5240

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The construction and reduction of strong
The construction and reduction of strong snarks
✍ P.A. Sinclair πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 953 KB

Let G be a 3-regular graph and let w be a weight function, w : E(G) --~ {1, 2}, for which the edges of weight 2 form a 1-factor of G. If w can be choosen such that there does not exist a circuit cover ~ for (G, w) in which each edge of G is contained in w(e) circuits of ~ then G is called a strong s

The full-degree spanning tree problem
The full-degree spanning tree problem
✍ Randeep Bhatia; Samir Khuller; Robert Pless; Yoram J. Sussmann πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 136 KB

The full-degree spanning tree problem is defined as follows: Given a connected graph G G G = (V V V, E E E), find a spanning tree T T T to maximize the number of vertices whose degree in T T T is the same as in G G G (these are called vertices of "full" degree). This problem is NP-hard. We present a

An implicit full Eulerian method for the
An implicit full Eulerian method for the fluid–structure interaction problem
✍ S. Ii; K. Sugiyama; S. Takeuchi; S. Takagi; Y. Matsumoto πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 357 KB πŸ‘ 1 views

## Abstract A numerical method, which relaxes limitation of small time increment in fluid–structure interaction (FSI) simulations with hard solid, is developed based on a full Eulerian FSI model (Sugiyama __et al__. __Comput. Mech.__ 2010; **46**(1):147–157). In this model, the solid volume fractio