- the
treewidth of an
undirected graph is an
integer number which specifies, informally, how far the
graph is from
being a tree. The
smallest treewidth is...
-
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 com****tional
problems on the...
-
coloring may be
solved in
polynomial time when the
input is chordal. The
treewidth of an
arbitrary graph may be
characterized by the size of the cliques...
-
graphs and the star
height of
regular languages. Intuitively,
where the
treewidth of a
graph measures how far it is from
being a tree, this
parameter measures...
- And as with
treewidth, many
graph optimization problems may be
solved efficiently for
graphs of
small branchwidth. However,
unlike treewidth, the branchwidth...
-
whose treewidth is
bounded by a
constant can be
performed in
polynomial time. Here, the
treewidth can be the
primal treewidth, dual
treewidth, or incidence...
-
structural complexity of the graph; it is
closely related to
treewidth, but
unlike treewidth it can be
small for
dense graphs. It is
defined as the minimum...
- embedding, Hadwiger's conjecture, YΔY-reducible graphs, and
relations between treewidth and
graph diameter. Apex
graphs are
closed under the
operation of taking...
- It is NP-complete but fixed-parameter
tractable on
graphs of
bounded treewidth. The
monochromatic triangle problem takes as
input an n-node undirected...
-
searching number.
Pathwidth and path-decompositions are
closely analogous to
treewidth and tree decompositions. They play a key role in the
theory of
graph minors:...
