• No results found

Approaches for Graphs Near Structural Classes.

N/A
N/A
Protected

Academic year: 2020

Share "Approaches for Graphs Near Structural Classes."

Copied!
94
0
0

Loading.... (view fulltext now)

Full text

Loading

Figure

Figure 3.1 Three co-path sets (dashed edges), including one of minimum size (rightmost).
Table 3.1 Dynamic programming table parameters and upper bounds.
Figure 4.4 Runtimes of the MIB-enumerating algorithms on graphs where nB = 1000, nL/nR = 10, and theexpected edge density between O and L ∪ R was varied with all other densities were 0.05
Figure 4.5 Runtimes of the MIB-enumerating algorithms on graphs wherewas varied. The left panel has nO = 10 and the ratio nL/nR nB = 200 and the right panel has nB = 1000.
+7

References

Related documents

The result of the research showed that students who were taught by using stirred word game had better achievement in learning vocabulary than those who were taught by

This finding is inconsistent with findings from both South African and international studies which have looked at variables related to physical abuse and family violence and found

Succesvol werken rond ecodesign binnen het hoger onderwijs kan pas als de studenten zelf zich bewust zijn van de nood aan meer duurzame ontwikkeling.. Daarbij kan een reflectie op

Based on the dataset constituted from both physical and numerical model results, comprehensive equations are proposed for the prediction of energy losses at

However, we prove the problem is tractable on trees when the size of the residual set is bounded, but we show that for other classes of graphs such as complete bipartite graphs,

In this paper we consider some particular classes of graphs: paths, caterpillars, cycles, bipartite graphs, complete graphs, planar graphs; for each of these classes, we give

In Section 3 we focus on the Grundy colorings of some central classical graphs (complete graphs, complete bipartite graphs, complete k-ary trees, paths and cycles) for which

constructed the orthogonal double cover of complete bipartite graphs by a complete bipartite graph and the disjoint union of complete bipartite graphs with the cartesian product