A note on maximum independent set and related problems on box graphs

Andrzej Lingas, Martin Wahlén

    Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskriftPeer review

    4 Citeringar (SciVal)

    Sammanfattning

    A box graph is the intersection graph of orthogonal rectangles in the plane. We show that maximum independent set and minimum vertex cover on box graphs can be solved in subexponential time, more precisely, in time 2(O(rootn log n)), by applying Miller's simple cycle planar separator theorem [J. Comput. System Sci. 32 (1986) 265-279] (in spite of the fact that the input box graph might be strongly non-planar).
    Originalspråkengelska
    Sidor (från-till)169-171
    TidskriftInformation Processing Letters
    Volym93
    Utgåva4
    DOI
    StatusPublished - 2005

    Ämnesklassifikation (UKÄ)

    • Datavetenskap (datalogi)

    Fingeravtryck

    Utforska forskningsämnen för ”A note on maximum independent set and related problems on box graphs”. Tillsammans bildar de ett unikt fingeravtryck.

    Citera det här