Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers (Extended Abstract)
Foundations of Computer SciencePublished 1 January 1993
Charles E. Leiserson, Satish Rao, Sivan Toledo
Citations5
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
An increase of non-esterified fatty acid leads to a pronounced inhibition of net hepatic glycogen breakdown and increases gluconeogenesis whereas glucose production does not differ from the control condition.
Abstract
An increase of non-esterifled fatty acid leads to a pronounced inhibition of net hepatic glycogen breakdown and increases gluconeogenesis whereas glucose production does not differ from the control condition. We suggest that this effect is not due to increased availability of glycerol alone but rather to lipid-dependent control of hepatic glycogen stores.
Keywords
Computer Science
Journal of the Operational Research SocietyIntroduction to Algorithms
16,942 Citations1991V. J. Rayward‐Smith, Thomas H. Cormen +2 more
A multigrid tutorial
1,874 Citations1987William L. Briggs
This paper presents an implementation of Multilevel adaptive methods for Algebraic multigrid (AMG), a version of which has already been described in more detail in the preface.
Sparse partitions
301 Citations2002Baruch Awerbuch, David Peleg
A collection of clustering and decomposition techniques that make possible the construction of sparse and locality-preserving representations for arbitrary networks is presented and several other graph-theoretic structures that are strongly related to covers are discussed.
A unified geometric approach to graph separators
166 Citations2002Gary L. Miller, Shang‐Hua Teng +1 more
A separator bound is proved for k-overlap graphs embedded in d dimensions, which unifies several earlier separator results.
Separators in two and three dimensions
75 Citations1990Gary L. Miller, William P. Thurston
It is shown that every graph that is the 1-skeleton of a simplicial complex K in 3-dimensions has a separator of size O(c 2/3 + ~), which gets an O(n 2) time algorithm for solving linear systems that arise from the finite element method.
New graph decompositions and fast emulations in hypercubes and butterflies
12 Citations1993Christos Kaklamanis, Danny Kriz̧anc +1 more
This paper presents a new type of graph decomposition called a cut-cover that combines the notions of graph separators and t-neighborhood covers and shows how to emulate any N-node bounded degree planar network or any IV- node bounded degree graph that excludes Ko(l) as a minor with O(log* N) slowdown on butterfly networks.