281 search results - page 12 / 57 » Better Polynomial Algorithms on Graphs of Bounded Rank-Width |
83
Voted
CAV
2003
Springer
15 years 2 months ago
2003
Springer
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
CCCG
1998
14 years 11 months ago
1998
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...
DAM
2010
14 years 9 months ago
2010
Rank-width is a structural graph measure introduced by Oum and Seymour and aimed at better handling of graphs of bounded clique-width. We propose a formal mathematical framework an...
MST
2007
14 years 9 months ago
2007
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
CSR
2009
Springer
15 years 4 months ago
2009
Springer
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σp 2 . In the case of linear matroids, which are represented over poly...