On NC algorithms for problems on bounded rank-width graphs

On NC algorithms for problems on bounded rank-width graphs

Das, Bireswar; Dasgupta, Anirban; Enduri, Murali Krishna; Reddy, Vinod.I
URI: https://repository.iitgn.ac.in/handle/123456789/3843
http:/doi.org/0.1016/j.ipl.2018.07.007
Date: 2018-11

Abstract:

In this paper, we show that for a fixed k, there is an NC algorithm that separates the graphs of rank-width at most k from those with rank-width at least

Show full item record

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Search Digital Repository


Browse

My Account