Results 1  10
of
1,096,271
Minimum Cuts and Shortest NonSeparating Cycles via Homology Covers
 SYMPOSIUM ON DISCRETE ALGORITHMS
, 2011
"... Let G be a directed graph with weighted edges, embedded on a surface of genus g with b boundaries. We describe an algorithm to compute the shortest directed cycle in G in any given � 2homology class in 2 O(g+b) n log n time; this problem is NPhard even for undirected graphs. We also present two ap ..."
Abstract

Cited by 18 (5 self)
 Add to MetaCart
applications of our algorithm. The first is an algorithm to compute the shortest nonseparating directed cycle in G in 2 O(g) n log n time, improving the recent algorithm of Cabello et al. [SOCG 2010] for all g = o(log n). The second is a combinatorial algorithm to compute minimum (s, t)cuts in undirected
Shortest nontrivial cycles in directed surface graphs
 In Proc. 27th Ann. Symp. Comput. Geom
, 2011
"... Let G be a directed graph embedded on a surface of genus g. We describe an algorithm to compute the shortest nonseparating cycle in G in O(g 2 n log n) time, exactly matching the fastest algorithm known for undirected graphs. We also describe an algorithm to compute the shortest noncontractible cy ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
Let G be a directed graph embedded on a surface of genus g. We describe an algorithm to compute the shortest nonseparating cycle in G in O(g 2 n log n) time, exactly matching the fastest algorithm known for undirected graphs. We also describe an algorithm to compute the shortest non
Faster shortest noncontractible cycles in directed surface graphs
 CoRR
"... Let G be a directed graph embedded on a surface of genus g with b boundary cycles. We describe an algorithm to compute the shortest noncontractible cycle in G in O((g 3 + g b)n log n) time. Our algorithm improves the previous best known time bound of (g + b) O(g+b) n log n for all positive g and b. ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
. We also describe an algorithm to compute the shortest nonnullhomologous cycle in G in O((g 2 + g b)n log n) time, generalizing a known algorithm to compute the shortest nonseparating cycle.
Shortest Nontrivial Cycles in Directed and Undirected Surface Graphs
"... Let G be a graph embedded on a surface of genus g with b boundary cycles. We describe algorithms to compute multiple types of nontrivial cycles in G, using different techniques depending on whether or not G is an undirected graph. If G is undirected, then we give an algorithm to compute a shortest ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
nonseparating cycle in G in 2O(g) n log log n time. Similar algorithms are given to compute a shortest noncontractible or nonnullhomologous cycle in 2O(g+b) n log log n time. Our algorithms for undirected G combine an algorithm of Kutz with known techniques for efficiently enumerating homotopy
Nonnumerical Algorithms and Problems General
"... We present an algorithm that computes a shortest noncontractible and a shortest nonseparating cycle on an orientable combinatorial surface of bounded genus in O(n log n) time, where n denotes the complexity of the surface. This solves a central open problem in computational topology, improving upon ..."
Abstract
 Add to MetaCart
We present an algorithm that computes a shortest noncontractible and a shortest nonseparating cycle on an orientable combinatorial surface of bounded genus in O(n log n) time, where n denotes the complexity of the surface. This solves a central open problem in computational topology, improving
Indivisible labor and the business cycle
 Journal of Monetary Economics
, 1985
"... A growth model with shocks to technology is studied. Labor is indivisible, so all variability in hours worked is due to fluctuations in the number employed. We find that, unlike previous equilibrium models of the business cycle, this economy displays large fluctuations in hours worked and relatively ..."
Abstract

Cited by 793 (10 self)
 Add to MetaCart
A growth model with shocks to technology is studied. Labor is indivisible, so all variability in hours worked is due to fluctuations in the number employed. We find that, unlike previous equilibrium models of the business cycle, this economy displays large fluctuations in hours worked
Finding shortest nonseparating and noncontractible cycles for topologically embedded graphs
 Discrete Comput. Geom
, 2005
"... We present an algorithm for finding shortest surface nonseparating cycles in graphs embedded on surfaces in O(g 3/2 V 3/2 log V + g 5/2 V 1/2) time, where V is the number of vertices in the graph and g is the genus of the surface. If g = o(V 1/3−ε), this represents a considerable improvement over p ..."
Abstract

Cited by 47 (9 self)
 Add to MetaCart
We present an algorithm for finding shortest surface nonseparating cycles in graphs embedded on surfaces in O(g 3/2 V 3/2 log V + g 5/2 V 1/2) time, where V is the number of vertices in the graph and g is the genus of the surface. If g = o(V 1/3−ε), this represents a considerable improvement over
Finding the k Shortest Paths
, 1997
"... We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest pat ..."
Abstract

Cited by 401 (2 self)
 Add to MetaCart
We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest
House Prices, Borrowing Constraints, and Monetary Policy in the Business Cycle
, 2002
"... I develop a general equilibrium model with sticky prices, credit constraints, nominal loans and asset prices. Changes in asset prices modify agents ’ borrowing capacity through collateral value; changes in nominal prices affect real repayments through debt deflation. Monetary policy shocks move asse ..."
Abstract

Cited by 496 (10 self)
 Add to MetaCart
I develop a general equilibrium model with sticky prices, credit constraints, nominal loans and asset prices. Changes in asset prices modify agents ’ borrowing capacity through collateral value; changes in nominal prices affect real repayments through debt deflation. Monetary policy shocks move asset and nominal prices in the same direction, and are amplified and propagated over time. The “financial accelerator ” is not constant across shocks: nominal debt stabilises supply shocks, making the economy less volatile when the central bank controls the interest rate. I discuss the role of equity, debt indexation and household and firm leverage in the propagation mechanism. Finally, I find that monetary policy should not target asset prices as a means of reducing output and inflation volatility.
Results 1  10
of
1,096,271