2 citations · 2 across the 5 of their papers we have counts for
5 papers
Rhombus Criterion and the Chordal Graph Polytope
Svante Linusson, Petter Restadh
The purpose of this paper is twofold. We investigate a simple necessary condition, called the rhombus criterion, for two vertices in a polytope not to form an edge and show that in…
Diameters of the Characteristic Imset Polytopes
Petter Restadh
It has been shown that the edge structure of the characteristic imset polytope is closely connected to the question of causal discovery. The diameter of a polytope is an indicator…
On the Edges of Characteristic Imset Polytopes
Svante Linusson, Petter Restadh, Liam Solus
The edges of the characteristic imset polytope, , were recently shown to have strong connections to causal discovery as many algorithms could be interpreted a…
Greedy Causal Discovery is Geometric
Svante Linusson, Petter Restadh, Liam Solus
Finding a directed acyclic graph (DAG) that best encodes the conditional independence statements observable from data is a central question within causality. Algorithms that greedi…
LaserTank is NP-complete
Per Alexandersson, Petter Restadh
We show that the classical game LaserTank is -complete, even when the tank movement is restricted to a single column and the only blocks appearing on the board are mir…