Live briefing
Everything about Rank-width
Graph width parameter used in graph theory
Rank-width is a graph width parameter used in graph theory and parameterized complexity, and defined using linear algebra. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Rank-widthA 5-minute orientation
- Skim a recent paper: Canonisation and Definability for Graphs of Bounded Rank WidthInfluential work since 2022
- Pick up a classic book: Intelligence BulletinThe most-reprinted book on the subject
- Read the landmark paper: Rank-width and vertex-minorsCited 166 times
- Go sideways: Branch-decompositionA closely related topic
- Go sideways: Clique-widthA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
No outline available.
🏆 Landmark papers (most cited)
Rank-width and vertex-minors
Approximating rank-width and clique-width quickly
On parse trees and Myhill–Nerode-type tools for handling graphs of bounded rank-width
Rank-width: Algorithmic and structural results
Rank‐width is less than or equal to branch‐width
Facial width-to-height ratio differs by social rank across organizations, countries, and value systems
Rank-Width and Well-Quasi-Ordering
The Rank-Width of Edge-Coloured Graphs
🆕 Influential since 2022
📚 Books worth reading
Intelligence BulletinUnited States. War Department. Military Intelligence Service · 1942
The Elements of Statistical LearningTrevor Hastie, Robert Tibshirani · 2001
Treaty Occupationay ToxicologySuelen Queiroz · 2010- 📕Sharp orders of n-width of Sobolev's classes on compact globally symmetric spaces of rank 1Alexander Kushpel, Sergio A. Tozoni · 2002
Mathematical and Engineering Methods in Computer ScienceA. Kučera · 2013
Automated Deduction – CADE-24Maria Paola Bonacina · 2013
SPSSSidney Tyrrell · 2013
SPSSSidney Tyrrell · 2013
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Branch-decomposition In graph theory, a branch-decomposition of an undirected graph G is a hierarchical clustering of the edges of G, represented by an unrooted binary tree…
- Clique-width In graph theory, the clique-width of a graph G is a parameter that describes the structural complexity of the graph; it is closely related to treewidth…
- Graph structure theorem In mathematics, the graph structure theorem is a major result in the area of graph theory. The result establishes a deep and fundamental connection between…
- Treewidth In graph theory, the treewidth of an undirected graph is an integer number which specifies, informally, how far the graph is from being a tree. The smallest…
- Graph bandwidth In graph theory, the graph bandwidth problem may be visualized as placing the vertices of a given graph at distinct integer positions along the number…
- Bramble (graph theory) In graph theory, a bramble for an undirected graph G is a family of connected subgraphs of G that all touch each other: for every pair of disjoint subgraphs…
- Carving width In graph theory, the carving width of a graph is a number, defined from the graph, that describes the number of edges separating the clusters in a hierarchical…
- Hadwiger number In graph theory, the Hadwiger number of an undirected graph G is the size of the largest complete graph that can be obtained by contracting edges of G…