Max-cut in circulant graphs (Q1201272): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Daniel Turzík / rank
Normal rank
 
Property / author
 
Property / author: Daniel Turzík / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism of circulant graphs and digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the Bipartite Subgraph Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cut polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets for the cut cone. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circulants and their connectivities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal bipartite subgraphs of cubic triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximumk-colorable subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark on max-cut problem with an application to digital-analogue convertors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Algorithm for Constructing a Large Bipartite Subgraph, with an Application to a Satisfiability Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3784112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum bipartite subgraphs of Kneser graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of spanning trees of circulant graphs / rank
 
Normal rank

Latest revision as of 13:03, 17 May 2024

scientific article
Language Label Description Also known as
English
Max-cut in circulant graphs
scientific article

    Statements

    Max-cut in circulant graphs (English)
    0 references
    0 references
    0 references
    17 January 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    \(t\)-regular cut
    0 references
    max-cut problem
    0 references
    circulant graphs
    0 references
    cycle
    0 references
    bipartite subgraph polytope
    0 references
    cut polytope
    0 references