Rank-width: algorithmic and structural results (Q2403788)

From MaRDI portal

Revision as of 10:00, 14 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Rank-width: algorithmic and structural results	scientific article

Statements

scholarly article

0 references

Rank-width: algorithmic and structural results (English)

0 references

zbMATH Open document ID

0 references

10.1016/j.dam.2016.08.006

0 references

0 references

Discrete Applied Mathematics

0 references

publication date

12 September 2017

0 references

full work available at URL

https://arxiv.org/abs/1601.03800

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

rank-width

0 references

clique-width

0 references

NLC-width

0 references

vertex-minor

0 references

Boolean-width

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

Obstructions for linear rank-width at most 1

0 references

Linear rank-width and linear clique-width of trees

0 references

Submodular partition functions

0 references

Distance-hereditary graphs

0 references

A $c^k n$ 5-Approximation Algorithm for Treewidth

0 references

A note on exact algorithms for vertex ordering problems on graphs

0 references

Greedy algorithm and symmetric matroids

0 references

Isotropic systems

0 references

Graphic presentations of isotropic systems

0 references

0 references

Transforming trees by successive local complementations

0 references

0 references

Boolean-width of graphs

0 references

Fast matrix rank algorithms and applications

0 references

Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors

0 references

Polynomial-time recognition of clique-width \(\leq 3\) graphs

0 references

On the Relationship Between Clique-Width and Treewidth

0 references

Clique-width and edge contraction

0 references

Fly-automata for checking monadic second-order properties of graphs of bounded tree-width

0 references

Handle-rewriting hypergraph grammars

0 references

Linear time solvable optimization problems on graphs of bounded clique-width

0 references

Upper bounds to the clique width of graphs

0 references

Vertex-minors, monadic second-order logic, and a conjecture by Seese

0 references

Parameterized Algorithms

0 references

Local complementation and interlacement graphs

0 references

Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract)

0 references

Fundamentals of parameterized complexity

0 references

Classes of graphs with small rank decompositions are \(\chi \)-bounded

0 references

0 references

Rank-width and tree-width of \(H\)-minor-free graphs

0 references

On the monotonicity of games generated by symmetric submodular functions.

0 references

ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES

0 references

The branchwidth of graphs and their cycle matroids

0 references

Tree-depth and vertex-minors

0 references

Finding Branch-Decompositions and Rank-Decompositions

0 references

A Faster Scaling Algorithm for Minimizing Submodular Functions

0 references

A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions

0 references

The rank-width of the square grid

0 references

The “Art of Trellis Decoding” Is Fixed-Parameter Tractable

0 references

Constructive algorithm for path-width of matroids

0 references

Excluded vertex-minors for graphs of linear rank-width at most \(k\)

0 references

0 references

Vertex-minor reductions can simulate edge contractions

0 references

Well-quasi-ordering of matrices under Schur complement and applications to directed graphs

0 references

The rank-width of edge-coloured graphs

0 references

Matroid Pathwidth and Code Trellis Complexity

0 references

0 references

Graphs of small rank-width are pivot-minors of graphs of small tree-width

0 references

Rank-width of random graphs

0 references

Number of Cliques in Graphs with a Forbidden Subdivision

0 references

Partitions versus sets: a case of duality

0 references

0 references

Linear Layouts in Submodular Systems

0 references

A faster strongly polynomial time algorithm for submodular function minimization

0 references

Rank-width and vertex-minors

0 references

Approximating rank-width and clique-width quickly

0 references

Rank-Width and Well-Quasi-Ordering

0 references

Rank‐width is less than or equal to branch‐width

0 references

Computing rank-width exactly

0 references

Excluding a bipartite circle graph from line graphs

0 references

Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices

0 references

Faster algorithms for vertex partitioning problems parameterized by clique-width

0 references

Approximating clique-width and branch-width

0 references

Testing branch-width

0 references

0 references

Graph minors. II. Algorithmic aspects of tree-width

0 references

Graph minors. V. Excluding a planar graph

0 references

Graph minors. IV: Tree-width and well-quasi-ordering

0 references

Graph minors. X: Obstructions to tree-decomposition

0 references

Graph minors. XX: Wagner's conjecture

0 references

A combinatorial algorithm minimizing submodular functions in strongly polynomial time.

0 references

Call routing and the ratcatcher

0 references

\(k\)-NLC graphs and polynomial algorithms

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2403788

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2403788&oldid=36344068"