Cellular processing algorithm for the vertex bisection problem: Detailed analysis and new component design

    Jesús David Terán Villanueva
    Jesús David Terán Villanueva
    Héctor Joaquín Fraire Huacuja
    Héctor Joaquín Fraire Huacuja
    José A. Castán-Rocha
    José A. Castán-Rocha

    Inf. Sci., pp. 62-82, 2019.

    Cited by: 0|Bibtex|Views7|Links
    EI

    Abstract:

    Abstract The vertex bisection problem splits a graph G = ( V , E ) into two sets, L ⊆ V , | L | = ⌊ | V | / 2 ⌋ and R = V ∖ L , such that it minimizes the number of vertices in L connected to R . This problem is a combinatorial NP-hard problem with relevant applications in network comm...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments