-
The maximum average degree of a graph is the maximum, over all subgraphs H of a graph G, of average_degree(H).
This can be computed in polynomial time ( though I do not know of any practical way to…
-
This is a meta issue where we can track all of the problems, "wish we had it", and feedback from this first cohort.
-
Im considering to develop flow-control mechanics for pyno.
Right now pyno do the update of all nodes 60 times per second. It is good for real-time systems, but bad for other classes of programs, fo…
-
Hi,
is it possible to calibrate with .pcd file as an input?!...could you provide any useful theory / blogs for lidar calibration.
-
#### Required Information
- DietPi version: G_DIETPI_VERSION_CORE=8 …
-
This ticket creates a new coding/two_weight_db module.
In it are stored all codes that were stored in graphs/strongly_regular_db.pyx. I expect that this file will change heavily, if we end up enric…
-
The `Graph/DiGraph` constructor are scary to look at, and waste a lot of computations in order to guess whether the user wants loops or multiple edges. In order to reduce this number of tests and ma…
-
Hi @initBasti
I have added support for a dual camera that seems to be OK but I can not figure out how to configure the cameras.
Here is the device tree for the second camera:
**rk3399.dtsi:*…
-
We improve the implementation of Wiener index for (weighted) (di)graphs by avoiding to compute and store into memory the full distance matrix. This way we can compute this index for larger graphs.
…
-
```
--- sage
def foo(n):
G = SymmetricGroup(n)
H = G.stabilizer(n//2)
return H.order()
time n = foo(200) // approx 399 seconds
--- magma
n foo(n)
G := Sym(n);
H := Stabiliser(G,n div 2);
r…