-
simple subcubic graph (SSCG) is a
finite simple graph in
which each
vertex has a
degree of at most three.
Suppose we have a
sequence of
simple subcubic graphs...
- Rail
station code)
Stuart MacGill,
former Australian cricketer SCG, the
subcubic graph function, a
variation of Friedman's SSCG function, in mathematics...
- and is
generally regarded as the
benchmark for
maximum flow algorithms.
Subcubic O(VElog(V 2/E)) time
complexity can be
achieved using dynamic trees, although...
- MR 3452406 Williams,
Virginia V****ilevska; Williams, R. Ryan (2018), "
Subcubic equivalences between path, matrix, and
triangle problems",
Journal of the...
- 541, MR 2785823. Skulrattanakulchai, San (2004), "Acyclic
colorings of
subcubic graphs",
Information Processing Letters, 92 (4): 161–167, doi:10.1016/j...
-
approximation still holds for
instances restricted to
subcubic graphs, and even to
bipartite subcubic graphs.
Slater 1975;
Harary &
Melter 1976; Khuller...
- path
graphs and
cycle graphs. The
graphs of
carving width three are the
subcubic partial 2-trees. This
means that
their maximum degree is
three and that...
- Fabrizio; Saha, Barna; Williams,
Virginia V****ilevska (2019), "Truly
subcubic algorithms for
language edit
distance and RNA
folding via fast bounded-difference...
-
unbounded size, then the
graphs in the
family have
bounded cutwidth. In
subcubic graphs (graphs of
maximum degree three), the
cutwidth equals the pathwidth...
- Nanongkai, and
Saranurak conjectured that OMv
cannot be
solved in "truly
subcubic" time. Formally, they
presented the
following conjecture: For any constant...
