Rank-width
id:
rank-width-251-16193190
title:
Rank-width
text:
Rank-width is a graph width parameter used in graph theory and parameterized complexity, and defined using linear algebra. It is defined from hierarchical clusterings of the vertices of a given graph, which can be visualized as ternary trees having the vertices as their leaves. Removing any edge from such a tree disconnects it into two subtrees and partitions the vertices into two subsets. The graph edges that cross from one side of the partition to the other can be described by a biadjacency ma
brand slug:
wiki
category slug:
encyclopedia
description:
Graph width parameter used in graph theory
original url:
https://en.wikipedia.org/wiki/Rank-width
date created:
date modified:
2024-01-11T23:08:05Z
main entity:
{"identifier":"Q109974955","url":"https://www.wikidata.org/entity/Q109974955"}
image:
fields total:
13
integrity:
14