- and
Tarjan attribute the
study of
pseudoforests to Dantzig's 1963 book on
linear programming, in
which pseudoforests arise in the
solution of
certain network...
-
between n-node
trees with two
distinguished nodes and
maximal directed pseudoforests. A
proof by
double counting due to Jim
Pitman counts in two different...
- is not invertible.
Finite endofunctions are
equivalent to
directed pseudoforests. For sets of size n
there are nn
endofunctions on the set. Particular...
- self-loops) and
therefore nn
possible pseudoforests. By
finding a
bijection between trees with two
labeled nodes and
pseudoforests, Joyal's
proof shows that Tn = nn − 2...
- is a
directed pseudoforest if and only if
every vertex has
outdegree at most 1. A
functional graph is a
special case of a
pseudoforest in
which every...
-
partitioned in the same way into k
pseudoforests, and
conversely any
partition of a graph's
edges into k
pseudoforests leads to an outdegree-k orientation...
-
Linear complementarity problem Max-flow min-cut
theorem of
networks Pseudoforest Vehicle routing problem Dantzig's
simplex algorithm Dantzig–Wolfe decomposition...
- and
graphs with
arboricity k are
exactly the (k,k)-sp**** graphs.
Pseudoforests are
exactly the (1,0)-sp**** graphs, and the
Laman graphs arising in...
- they are
known as
Bethe lattices.
Decision tree
Hypertree Multitree Pseudoforest Tree
structure (general) Tree (data structure)
Unrooted binary tree Bender...
- characterizations: forests,
linear forests (disjoint
unions of path graphs),
pseudoforests, and
cactus graphs;
planar graphs,
outerplanar graphs, apex
graphs (formed...
