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 leastby Bireswar Das, Anirban Dasgupta, Murali Krishna Enduri, and Vinod I. Reddy,2018-08-10 12:16:50https://doi.org/10.1016/j.ipl.2018.07.00
Separator decompositions have proven to be useful for e cient parallel shortest-path computation. In...
Separator decompositions have proven to be useful for efficient parallel shortest- path computation...
A graph G has tree-width at most w if it admits a tree-decomposition of width ≤ w. It is known that ...
Abstract. Although there exist many polynomial algorithms for NP-hard problems running on a clique-w...
Abstract. Rank-width is defined by Seymour and the author to inves-tigate clique-width; they show th...
We present a new algorithm that can output the rank-decomposition of width at most k of a graph if s...
We prove that the rank-width of an n-vertex graph can be com-puted exactly in time O(2nn3 log2 n log...
AbstractRank-width is a structural graph measure introduced by Oum and Seymour and aimed at better h...
We give the first NC algorithm for finding a clique separator decomposition of a graph, that is, a ...
In this paper we develop new algorithmic machinery for solving hard problems on graphs of bounded ra...
Rank-width was defined by Oum and Seymour [2006. Approximating clique-width and branch-width. J. Com...
Linear rank-width is a linearized variation of rank-width, and it is deeply related to matroid path-...
The main focus of this thesis is on using the divide and conquer technique to efficiently solve grap...
The clique-width is a measure of complexity of decomposing graphs into certain tree-like structures....
AbstractMany vertex-partitioning problems can be expressed within a general framework introduced by ...
Separator decompositions have proven to be useful for e cient parallel shortest-path computation. In...
Separator decompositions have proven to be useful for efficient parallel shortest- path computation...
A graph G has tree-width at most w if it admits a tree-decomposition of width ≤ w. It is known that ...
Abstract. Although there exist many polynomial algorithms for NP-hard problems running on a clique-w...
Abstract. Rank-width is defined by Seymour and the author to inves-tigate clique-width; they show th...
We present a new algorithm that can output the rank-decomposition of width at most k of a graph if s...
We prove that the rank-width of an n-vertex graph can be com-puted exactly in time O(2nn3 log2 n log...
AbstractRank-width is a structural graph measure introduced by Oum and Seymour and aimed at better h...
We give the first NC algorithm for finding a clique separator decomposition of a graph, that is, a ...
In this paper we develop new algorithmic machinery for solving hard problems on graphs of bounded ra...
Rank-width was defined by Oum and Seymour [2006. Approximating clique-width and branch-width. J. Com...
Linear rank-width is a linearized variation of rank-width, and it is deeply related to matroid path-...
The main focus of this thesis is on using the divide and conquer technique to efficiently solve grap...
The clique-width is a measure of complexity of decomposing graphs into certain tree-like structures....
AbstractMany vertex-partitioning problems can be expressed within a general framework introduced by ...
Separator decompositions have proven to be useful for e cient parallel shortest-path computation. In...
Separator decompositions have proven to be useful for efficient parallel shortest- path computation...
A graph G has tree-width at most w if it admits a tree-decomposition of width ≤ w. It is known that ...
DOI
Add to ORKG