Bounds on mincut for Cayley graphs over Abelian groups (Q733724): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00224-008-9105-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2022811082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the diameter and bisector size of Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bandwidth of Caterpillars with Hairs of Length 1 and 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4796189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999065 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An expository note on individual risk without aggregate uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth edge counts for linear arrangements of rectangular grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results for Bandwidth Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4192107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth of chain graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automorphisms, isotone self-maps and cycle-free orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding the minimum bandwidth of interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3725545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutwidth of the de Bruijn graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4862905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for the min-cut linear arrangement of trees / rank
 
Normal rank

Latest revision as of 02:19, 2 July 2024

scientific article
Language Label Description Also known as
English
Bounds on mincut for Cayley graphs over Abelian groups
scientific article

    Statements

    Bounds on mincut for Cayley graphs over Abelian groups (English)
    0 references
    0 references
    19 October 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph theory
    0 references
    Cayley graphs
    0 references
    bisection
    0 references
    mincut
    0 references
    bounds
    0 references
    algorithms
    0 references
    combinatorial optimization
    0 references
    0 references