Results 11  20
of
300,387
Packing Cycles in Graphs
, 1999
"... A graph G is called cycle Mengerian (CM) if for any nonnegative integral function w defined on V (G), the maximum number of cycles in G such that each vertex v is used at most w(v) times is equal to the minimum of P fw(v) : v 2 Sg, where the minimum is taken over all S ` V (G) such that deletin ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
A graph G is called cycle Mengerian (CM) if for any nonnegative integral function w defined on V (G), the maximum number of cycles in G such that each vertex v is used at most w(v) times is equal to the minimum of P fw(v) : v 2 Sg, where the minimum is taken over all S ` V (G
Cell cycle extracts
 Methods Cell Biol
, 1991
"... Abstract. The HERMES collaboration presents two sets of recent results: the first related to an extraction of the g2 nucleon structure function determined for DIS on a polarised target and the second related to the measurement of asymmetries related to the deeply virtual Compton scattering process t ..."
Abstract

Cited by 97 (1 self)
 Add to MetaCart
Abstract. The HERMES collaboration presents two sets of recent results: the first related to an extraction of the g2 nucleon structure function determined for DIS on a polarised target and the second related to the measurement of asymmetries related to the deeply virtual Compton scattering process
Packing Cycles in Graphs, II
"... A graph G packs if for every induced subgraph H of G, the maximum number of vertexdisjoint cycles in H is equal to the minimum number of vertices whose deletion from H results in a forest. The purpose of this paper is to characterize all graphs that pack. ..."
Abstract
 Add to MetaCart
A graph G packs if for every induced subgraph H of G, the maximum number of vertexdisjoint cycles in H is equal to the minimum number of vertices whose deletion from H results in a forest. The purpose of this paper is to characterize all graphs that pack.
Packing cycles with modularity constraints
 COMBINATORICA
"... We prove that for all positive integers k, there exists an integer N = N(k) such that the following holds. Let G be a graph and let Γ an abelian group with no element of order two. Let γ: E(G) → Γ be a function mapping elements of Γ to the edges of G. A nonzero cycle is a cycle C such that e∈E(C) γ ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We prove that for all positive integers k, there exists an integer N = N(k) such that the following holds. Let G be a graph and let Γ an abelian group with no element of order two. Let γ: E(G) → Γ be a function mapping elements of Γ to the edges of G. A nonzero cycle is a cycle C such that e
Restoring low resolution structure of biological macromolecules from solution scattering using simulated annealing
 Biophys. J
, 1999
"... ABSTRACT A method is proposed to restore ab initio low resolution shape and internal structure of chaotically oriented particles (e.g., biological macromolecules in solution) from isotropic scattering. A multiphase model of a particle built from densely packed dummy atoms is characterized by a confi ..."
Abstract

Cited by 112 (19 self)
 Add to MetaCart
ABSTRACT A method is proposed to restore ab initio low resolution shape and internal structure of chaotically oriented particles (e.g., biological macromolecules in solution) from isotropic scattering. A multiphase model of a particle built from densely packed dummy atoms is characterized by a
On Packing Shortest Cycles in Graphs
"... Abstract. We study the problems to find a maximum packing of shortest edgedisjoint cycles in a graph of given girth g (gESCP) and its vertexdisjoint analogue gVSCP. In the case g = 3, Caprara and Rizzi (2001) have shown that gESCP can be solved in polynomial time for graphs with maximum degree ..."
Abstract
 Add to MetaCart
Abstract. We study the problems to find a maximum packing of shortest edgedisjoint cycles in a graph of given girth g (gESCP) and its vertexdisjoint analogue gVSCP. In the case g = 3, Caprara and Rizzi (2001) have shown that gESCP can be solved in polynomial time for graphs with maximum degree
Scattering
"... eingereicht und durch die Fakultät für Physik am 10.12.2009 angenommen. 0.1 ABSTRACT i In our work we use small angle neutron scattering (SANS) as a versatile tool for the investigation of two different kinds of complex magnetic order: We examine the static and dynamic properties of the vortex latti ..."
Abstract
 Add to MetaCart
eingereicht und durch die Fakultät für Physik am 10.12.2009 angenommen. 0.1 ABSTRACT i In our work we use small angle neutron scattering (SANS) as a versatile tool for the investigation of two different kinds of complex magnetic order: We examine the static and dynamic properties of the vortex
LifeCycle Cost Sensitivity to BatteryPack Voltage of an HEV
, 2000
"... A detailed component performance, ratings, and cost study was conducted on series and parallel hybrid electric vehicle (HEV) configurations for several battery pack and main electric traction motor voltages while meeting stringent Partnership for a New Generation of Vehicles (PNGV) power delivery re ..."
Abstract
 Add to MetaCart
A detailed component performance, ratings, and cost study was conducted on series and parallel hybrid electric vehicle (HEV) configurations for several battery pack and main electric traction motor voltages while meeting stringent Partnership for a New Generation of Vehicles (PNGV) power delivery
scattering
, 2014
"... Subject Areas: biophysics, biomechanics, biomaterials acoustic microscopy, hexagonal crystals, Raman Biomechanics of fibrous proteins of the ..."
Abstract
 Add to MetaCart
Subject Areas: biophysics, biomechanics, biomaterials acoustic microscopy, hexagonal crystals, Raman Biomechanics of fibrous proteins of the
Results 11  20
of
300,387