Hypergraph Cuts with General Splitting Functions (Q5094916): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
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: MAXFLOW / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2001.02817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous Input and Output Matrix Partitioning for Outer-Product--Parallel Sparse Matrix-Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph Partitioning Based Models and Methods for Exploiting Cache Locality in Sparse Matrix-Vector Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical mechanics of complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent directions in netlist partitioning: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cross-linked structure of network evolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Hypergraph Eigenvector Centralities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diffuse Interface Models on Graphs for Classification of High Dimensional Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4787357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph Partitioning-Based Fill-Reducing Ordering for Symmetric Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Two-Dimensional Sparse Matrix Partitioning: Models, Methods, and a Recipe / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607983 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple and Fast Rounding Algorithms for Directed and Node-weighted Multiway Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cuts, modular functions, and matroid polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4931752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Flow and Testing Graph Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5514188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realization of set functions as cut functions of graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiway cuts in directed and node weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation techniques for hypergraph partitioning problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Flow-Based Refinement for Multilevel Hypergraph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling hypergraphs by graphs with the same mincut properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning Hypergraphs in Scientific Computing Applications through Vertex Separators on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763402 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing a sum of submodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming and Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutsets and partitions of hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structure and Function of Complex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow-Based Algorithms for Local Graph Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster strongly polynomial time algorithm for submodular function minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max flows in O(nm) time, or better / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Undirected Maximum Flows in <i>O</i>(<i>m</i>polylog(<i>n</i>)) Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Emerging frontiers in nonlinear science / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>k</i>-way Hypergraph Partitioning via <i>n</i>-Level Recursive Bisection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting Hypergraph Models for Sparse Matrix Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost flows, MDPs, and ℓ <sub>1</sub> -regression in nearly linear time for dense instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Gomory-Hu cut tree representation of a netlist partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realizing symmetric set functions as hypergraph cut capacity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expressive power of binary submodular functions / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2999163148 / rank
 
Normal rank

Latest revision as of 10:26, 30 July 2024

scientific article; zbMATH DE number 7568638
Language Label Description Also known as
English
Hypergraph Cuts with General Splitting Functions
scientific article; zbMATH DE number 7568638

    Statements

    Hypergraph Cuts with General Splitting Functions (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    5 August 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    hypergraph cuts
    0 references
    minimum \(s\)-\(t\) cut
    0 references
    submodular functions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references