A note on edge-based graph partitioning and its linear algebraic structure (Q662140): 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.1007/s10852-011-9154-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2011697549 / 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: Finding good approximate vertex and edge partitions is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for graph partition problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on approximating Max-Bisection on regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lock-gain based graph partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expected complexity of graph partitioning problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph partitioning by eigenvectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Quality of Spectral Separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new adaptive multi-start technique for combinatorial global optimizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient simulated annealing on fractal energy landscapes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fourier and Taylor series on fitness landscapes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001770 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3946078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of computing the minimum distance of a code / rank
 
Normal rank

Latest revision as of 23:00, 4 July 2024

scientific article
Language Label Description Also known as
English
A note on edge-based graph partitioning and its linear algebraic structure
scientific article

    Statements

    A note on edge-based graph partitioning and its linear algebraic structure (English)
    0 references
    0 references
    0 references
    0 references
    21 February 2012
    0 references
    linear algebra
    0 references
    edge-centric representation
    0 references
    graph partitioning
    0 references
    computational complexity
    0 references

    Identifiers

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