Live briefing
Everything about Carving width
Graph width parameter
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 clustering of the graph vertices. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Carving widthA 5-minute orientation
- Read the landmark paper: Budgeted constrained coverage on bounded carving-width and series-parallel multi-interface networksCited 12 times
- Go sideways: CutwidthA closely related topic
- Go sideways: Branch-decompositionA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Budgeted constrained coverage on bounded carving-width and series-parallel multi-interface networks
Characterizing graphs of small carving-width
The carving-width of generalized hypercubes
JPEG image width estimation for file carving
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width
đź“š Books worth reading
Open Library didn't respond; try again in a moment.
đź”— Related topics
- Cutwidth In graph theory, the cutwidth of an undirected graph is the smallest integer k {\displaystyle k} with the following property: there is an ordering of the…
- 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…
- Rank-width Rank-width is a graph width parameter used in graph theory and parameterized complexity, and defined using linear algebra. It is defined from hierarchical…
- Pathwidth In graph theory, a path decomposition of a graph G is, informally, a representation of G as a "thickened" path graph, and the pathwidth of G is a number…
- 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…
- Bidimensionality Bidimensionality theory characterizes a broad range of graph problems (bidimensional) that admit efficient approximate, fixed-parameter or kernel solutions…
- Tree decomposition In graph theory, a tree decomposition is a mapping of a graph into a tree that can be used to define the treewidth of the graph and speed up solving certain…
- Chordal graph In the mathematical area of graph theory, a chordal graph is one in which all cycles of four or more vertices have a chord, which is an edge that is not…