Multilevel Algorithms for Acyclic Partitioning of Directed Acyclic Graphs (Q5230645): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SparseMatrix / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Scotch / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PaToH / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: METIS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ADMAT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Chaco / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast (Structured) Newton Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Differentiation in MATLAB Using ADMAT with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The university of Florida sparse matrix collection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Characterizing the Data Access Complexity of Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Sequential Partitions of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Heuristic Procedure for Partitioning Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4580190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm for the acyclic partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering Multilevel Graph Partitioning Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multilevel refinement for combinatorial optimisation problems / rank
 
Normal rank

Latest revision as of 08:13, 20 July 2024

scientific article; zbMATH DE number 7099339
Language Label Description Also known as
English
Multilevel Algorithms for Acyclic Partitioning of Directed Acyclic Graphs
scientific article; zbMATH DE number 7099339

    Statements

    Multilevel Algorithms for Acyclic Partitioning of Directed Acyclic Graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 August 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    directed graph
    0 references
    acyclic partitioning
    0 references
    multilevel partitioning
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references