-
以下のテーブルは、各ゲーム理論のコンセプトに基づいて、職場で避けるべきアクションと推奨するアクションを示しています。これにより、より具体的な戦略的アプローチが可能になります。
| ゲーム理論のコンセプト | 避けるべきアクション | やるべきアクション …
-
Basic computer science:
- Sets
- Boolean algebra
- Graph theory
- Minimum Spanning Tree (Prim, Kruskal)
- Shortest Path (Dijkstra, Bellman-Ford, Floyd-Warshall)
Useful tools:
- Wireshark
- s…
-
implementing SRGs described in
```
Matthew Fickus, John Jasper, Dustin G. Mixon, Jesse D. Peterson & Cody E. Watson,
Equiangular tight frames with centroidal symmetry,
arXiv:1509.04059, Sep. 2015.…
-
Things to do to finish off the clock code:
1. Support import of the clock network in an rr_graph.xml. I think this just needs a
tag to be supported, and to identify the virtual clock sink.
2.…
-
Hello, @rudrakshi99 @nakul-19 @plazzy99
I am GSSOC'21 participant.
What I will include -: (suggest if something needs to be added)
1. What is Bipartite Graph
2. Two coloring problem
3. Bipar…
-
Contracts edges in a graph so that we can compute the Tutte polynomial (#1314)
This version of contracting edges is different from #7304 (this code will keep resulting multiedges and remove contrac…
-
Nitpick: The `degree_dist()` method has a name that is perhaps not the best fit. What this function returns is not a distribution, but a list of degrees. In graph theory this is called a degree seque…
-
This is a suggestion to support the graph6, sparse6 and digraph6 file formats. These are used by the [nauty suite](http://pallini.di.uniroma1.it). Nauty comes with many command line tools that read a…
-
Two equal elements of a finitely presented group does not have equal hash. For example:
```
sage: G=groups.presentation.KleinFour()
sage: a,b=G.generators()
sage: a^3 == a
True
sage: hash(a^3)
1453…
-
I want to filter graphs that satisfy that $|N(x)\cup N(y)|\ge \frac{2(n-1)}{3}$ for any $xy\notin E(G)$?
Note that $N(v)$ refers to the neighborhood of a vertex $v$.
First, I did not see the "N(…