Recent Advances in Graph Partitioning | SpringerLink Skip to main content Advertisement
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart …

This survey describes research directions in netlist partitioning during the past two decades
in terms of both problem formulations and solution approaches. We discuss the traditional …

This book deals with the analysis of the structure of complex networks by combining results
from graph theory, physics, and pattern recognition. The book is divided into two parts. 11 …

In this paper we propose a scheme that combines type inference and run-time checking to
make existing C programs type safe. We describe the CCured type system, which extends …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

Algorithms for Graph Partitioning: A Survey Page 1 Link oping Electronic Articles in Computer
and Information Science Vol. 3(1998): nr 10 Link oping University Electronic Press Link oping …

In this paper, a partitioning approach for large-scale systems based on graph-theory is
presented. The algorithm starts with the translation of the system model into a graph …

Much of the software in everyday operation is not making optimal use of the hardware on
which it actually runs. Among the reasons for this discrepancy are hardware/software …

Data-layout optimizations rearrange fields within objects, objects within objects, and objects
within the heap, with the goal of increasing spatial locality. While the importance of data …

The increasing computational complexity of DNNs achieved unprecedented successes in
various areas such as machine vision and natural language processing (NLP), eg, the …