Multi-way sparsest cut problem on trees with a control on the number of parts and outliers (Q2217481): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Ramin Javadi / rank
Normal rank
 
Property / author
 
Property / author: Ramin Javadi / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3108022387 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1702.05570 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues and expanders / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander flows, geometric embeddings and graph partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3969900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry and spectra of compact Riemann surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3344779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating Multicut and Sparsest-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the isoperimetric spectrum of graphs and its approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of isoperimetric problems on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On nodal domains and higher-order Cheeger inequalities of finite reversible Markov processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering and outlier detection using isoperimetric number of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Clustering: Theory, Algorithms, and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander graphs and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-way spectral partitioning and higher-order cheeger inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithm for Sparsest <i>k</i>-Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isoperimetric numbers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isoperimetric constants and the first eigenvalue of a compact riemannian manifold / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters / rank
 
Normal rank

Latest revision as of 06:01, 24 July 2024

scientific article
Language Label Description Also known as
English
Multi-way sparsest cut problem on trees with a control on the number of parts and outliers
scientific article

    Statements

    Multi-way sparsest cut problem on trees with a control on the number of parts and outliers (English)
    0 references
    0 references
    0 references
    29 December 2020
    0 references
    sparsest cut problem
    0 references
    isoperimetric number
    0 references
    Cheeger constant
    0 references
    normalized cut
    0 references
    graph partitioning
    0 references
    computational complexity
    0 references
    weighted trees
    0 references

    Identifiers

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