Sciweavers

1951 search results - page 66 / 391
» An algorithm for improving graph partitions
Sort
View
123
Voted
JCC
2007
110views more  JCC 2007»
15 years 3 months ago
Improved grid-based algorithm for Bader charge allocation
: An improvement to the grid-based algorithm of Henkelman et al. for the calculation of Bader volumes is suggested, which more accurately calculates atomic properties as predicted ...
Edward Sanville, Steven D. Kenny, Roger Smith, Gra...
ICS
2007
Tsinghua U.
15 years 10 months ago
Cooperative cache partitioning for chip multiprocessors
This paper presents Cooperative Cache Partitioning (CCP) to allocate cache resources among threads concurrently running on CMPs. Unlike cache partitioning schemes that use a singl...
Jichuan Chang, Gurindar S. Sohi
APPROX
2010
Springer
220views Algorithms» more  APPROX 2010»
15 years 5 months ago
Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs
We present a simple factor 6 algorithm for approximating the optimal multiplicative distortion of embedding (unweighted) graph metrics into tree metrics (thus improving and simplif...
Victor Chepoi, Feodor F. Dragan, Ilan Newman, Yuri...
GD
2008
Springer
15 years 5 months ago
An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges
Abstract. We present a linear-time algorithm for solving the simultaneous embedding problem with fixed edges (SEFE) for a planar graph and a pseudoforest (a graph with at most one...
J. Joseph Fowler, Carsten Gutwenger, Michael J&uum...
138
Voted
DAM
2008
134views more  DAM 2008»
15 years 4 months ago
Efficient algorithms for finding critical subgraphs
This paper presents algorithms to find vertex-critical and edgecritical subgraphs in a given graph G, and demonstrates how these critical subgraphs can be used to determine the ch...
Christian Desrosiers, Philippe Galinier, Alain Her...