Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 -
8 of
8
Magnetic Braking of Ap/Bp Stars: Application to Compact Black-Hole X-Ray Binaries
, 2005
"... We examine the proposal that the subset of neutron-star and black-hole X-ray binaries that form with Ap or Bp star companions will experience systemic angular-momentum losses due to magnetic braking, not otherwise operative with intermediate-mass companion stars. We suggest that for donor stars poss ..."
Abstract
- Add to MetaCart
orbital periods during mass transfer. In this paper we detail how such a magnetic braking scenario operates. We apply it to a specific astrophysics problem involving the formation of compact black-hole binaries with low-mass donor stars. At present, it is not understood how these systems form, given
All-Pairs Bottleneck Paths in Vertex Weighted Graphs
- In Proc. of SODA, 978–985
, 2007
"... Let G = (V, E, w) be a directed graph, where w: V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smallest weight of a vertex on the path. For two vertices u, v the bottleneck weight, or the capacity, from u to v, denoted c(u, v), ..."
Abstract
-
Cited by 9 (1 self)
- Add to MetaCart
), is the maximum bottleneck weight of a path from u to v. In the All-Pairs Bottleneck Paths (APBP) problem we have to find the bottleneck weights for all ordered pairs of vertices. Our main result is an O(n 2.575) time algorithm for the APBP problem. The exponent is derived from the exponent of fast matrix
All-Pairs Bottleneck Paths For General Graphs in Truly Sub-Cubic Time
- STOC'07
, 2007
"... In the all-pairs bottleneck paths (APBP) problem (a.k.a. allpairs maximum capacity paths), one is given a directed graph with real non-negative capacities on its edges and is asked to determine, for all pairs of vertices s and t, the capacity of a single path for which a maximum amount of flow can b ..."
Abstract
-
Cited by 12 (6 self)
- Add to MetaCart
In the all-pairs bottleneck paths (APBP) problem (a.k.a. allpairs maximum capacity paths), one is given a directed graph with real non-negative capacities on its edges and is asked to determine, for all pairs of vertices s and t, the capacity of a single path for which a maximum amount of flow can
All Pairs Bottleneck Paths and Max-Min Matrix Products in Truly Subcubic Time
, 2009
"... In the all pairs bottleneck paths (APBP) problem, one is given a directed graph with real weights on its edges. Viewing the weights as capacities, one is asked to determine, for all pairs (s,t) of vertices, the maximum amount of flow that can be routed along a single path from s to t. The APBP pro ..."
Abstract
-
Cited by 5 (0 self)
- Add to MetaCart
In the all pairs bottleneck paths (APBP) problem, one is given a directed graph with real weights on its edges. Viewing the weights as capacities, one is asked to determine, for all pairs (s,t) of vertices, the maximum amount of flow that can be routed along a single path from s to t. The APBP
Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems?
"... Abstract. We introduce a new problem that combines the well known All Pairs Shortest Paths (APSP) problem and the All Pairs Bottleneck Paths (APBP) problem to compute the shortest paths for all pairs of vertices for all possible flow amounts. We call this new problem the All Pairs Shortest Paths for ..."
Abstract
- Add to MetaCart
Abstract. We introduce a new problem that combines the well known All Pairs Shortest Paths (APSP) problem and the All Pairs Bottleneck Paths (APBP) problem to compute the shortest paths for all pairs of vertices for all possible flow amounts. We call this new problem the All Pairs Shortest Paths
Fast algorithms for (max,min)-matrix multiplication and bottleneck shortest paths
- In Proc. 19th SODA
, 2009
"... Given a directed graph with a capacity on each edge, the all-pairs bottleneck paths (APBP) problem is to determine, for all vertices s and t, the maximum flow that can be routed from s to t. For dense graphs this problem is equivalent to that of computing the (max, min)transitive closure of a real-v ..."
Abstract
-
Cited by 14 (1 self)
- Add to MetaCart
Given a directed graph with a capacity on each edge, the all-pairs bottleneck paths (APBP) problem is to determine, for all vertices s and t, the maximum flow that can be routed from s to t. For dense graphs this problem is equivalent to that of computing the (max, min)transitive closure of a real
A search for strong, ordered magnetic fields in Herbig Ae/Be stars ⋆
, 2008
"... The origin of magnetic fields in intermediate-mass and high-mass stars is fundamentally a mystery. Clues toward solving this basic astrophysical problem can likely be found at the pre-main sequence (PMS) evolutionary stage. With this work, we perform the largest and most sensitive search for magneti ..."
Abstract
- Add to MetaCart
The origin of magnetic fields in intermediate-mass and high-mass stars is fundamentally a mystery. Clues toward solving this basic astrophysical problem can likely be found at the pre-main sequence (PMS) evolutionary stage. With this work, we perform the largest and most sensitive search
