Tree-Based Coarsening and Partitioning of Complex Networks (Q5266614): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1145/2851496 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2298648390 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2889270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Distance on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5298946 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient graph-based image segmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general framework for graph sparsification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-Based Coarsening and Partitioning of Complex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4410202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph partitioning models for parallel computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs, networks and algorithms. Based on the translation of the 3rd German edition by Tilla Schade in collaboration with the author / rank
 
Normal rank
Property / cites work
 
Property / cites work: On clusterings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4394942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering Algorithms for Approximate Weighted Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: n-Level Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of small cuts via cycle space sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advanced Coarsening Schemes for Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combined evolutionary search and multilevel optimisation approach to graph-partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank

Latest revision as of 00:35, 14 July 2024

scientific article; zbMATH DE number 6732200
Language Label Description Also known as
English
Tree-Based Coarsening and Partitioning of Complex Networks
scientific article; zbMATH DE number 6732200

    Statements

    Tree-Based Coarsening and Partitioning of Complex Networks (English)
    0 references
    0 references
    0 references
    0 references
    16 June 2017
    0 references
    graph coarsening
    0 references
    complex networks
    0 references
    conductance
    0 references
    fundamental cuts
    0 references
    multilevel graph partitioning
    0 references
    spanning trees
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references