[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Schamberger, 2003 - Google Patents

Improvements to the helpful-set algorithm and a new evaluation scheme for graph-partitioners

Schamberger, 2003

Document ID
5797328898511031320
Author
Schamberger S
Publication year
Publication venue
International Conference on Computational Science and its Applications

External Links

Snippet

Graph partitioning is an important subproblem in many applications. To solve it efficiently, the multilevel strategy in combination with a matching algorithm and a local refinement heuristic has proven to be a powerful method, and several libraries exist providing such an …
Continue reading at link.springer.com (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management, e.g. organising, planning, scheduling or allocating time, human or machine resources; Enterprise planning; Organisational models
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring

Similar Documents

Publication Publication Date Title
TWI396984B (en) Ranking functions using a biased click distance of a document on a network
EP2270677A2 (en) Depth-first search for target value problems
Pellegrini A parallelisable multi-level banded diffusion scheme for computing balanced partitions with smooth boundaries
US20120192138A1 (en) Graph partitioning with natural cuts
Gottlieb et al. Improved algorithms for fully dynamic geometric spanners and geometric routing.
Hillston et al. A simple time scale decomposition technique for stochastic process algebras
Schamberger Improvements to the helpful-set algorithm and a new evaluation scheme for graph-partitioners
Xue Edge‐maximal triangulated subgraphs and heuristics for the maximum clique problem
Monien et al. Graph partitioning with the party library: Helpful-sets in practice
Baumer et al. Improving a probabilistic 3-SAT algorithm by dynamic search and independent clause pairs
Bu et al. A*+ BFHS: A hybrid heuristic search algorithm
Georgiadis et al. An experimental study of minimum mean cycle algorithms
US9746850B2 (en) Computer-implemented systems and methods for generating generalized fractional designs
Castro Solving difficult multicommodity problems with a specialized interior-point algorithm
López-Presa et al. Novel techniques to speed up the computation of the automorphism group of a graph
Schamberger et al. A Locality Preserving Graph Ordering Approach for Implicit Partitioning: Graph-Filing Curves.
JP2005056421A (en) Method for solving combinatorial optimization problem containing a plurality of elements and values
Bhol et al. Machine Learning as a Service Cloud Selection: An MCDM Approach for Optimal Decision Making
CN109784066A (en) Method, apparatus, computer equipment and the storage medium of shared exploitation environment
Schamberger On partitioning FEM graphs using diffusion
Schamberger Heuristic Graph Bisection with Less Restrictive Balance Constraints.
Pinto et al. Variable neighborhood search for the elementary shortest path problem with loading constraints
Alberts et al. A software library of dynamic graph algorithms
Worley Simplifying Round-Based Distributed Graph Coloring
CN115190110B (en) Geographic position determining method and device