Search Results - "Pettersson, Ville H."

Planar Hypohamiltonian Graphs on 40 Vertices by Jooyandeh, Mohammadreza, McKay, Brendan D., Östergård, Patric R. J., Pettersson, Ville H., Zamfirescu, Carol T.

“…A graph is hypohamiltonian if it is not Hamiltonian, but the deletion of any single vertex gives a Hamiltonian graph. Until now, the smallest known planar…”
Get full text

On the maximum length of coil-in-the-box codes in dimension 8 by Östergård, Patric R.J., Pettersson, Ville H.

“…The coil-in-the-box problem asks for a simple chordless cycle of maximum length in the n-cube. Such cycles are also known as n-dimensional spread 2 circuit…”
Get full text

Exhaustive Search for Snake-in-the-Box Codes by Östergård, Patric R. J., Pettersson, Ville H.

“…The snake-in-the-box problem asks for the maximum length of a chordless path (also called snake) in the n -cube. A computer-aided approach for classifying long…”
Get full text

A Note on Toeplitz’ Conjecture by Pettersson, Ville H., Tverberg, Helge A., Östergård, Patric R. J.

“…In 1911, Toeplitz made a conjecture asserting that every Jordan curve in contains four points forming the corners of a square. Here Conjecture C is presented,…”
Get full text

Enumerating Hamiltonian Cycles by Pettersson, Ville H.

“…A dynamic programming method for enumerating hamiltonian cycles in arbitrary graphs is presented. The method is applied to grid graphs, king's graphs,…”
Get full text

Enumerating Perfect Matchings in n-Cubes by Östergård, Patric R. J., Pettersson, Ville H.

“…The perfect matchings in the n -cube have earlier been enumerated for n  ≤ 6. A dynamic programming approach is here used to obtain the total number of perfect…”
Get full text

Validating indirect fire models with field experiments : Verification, Validation, and Accreditation in Modeling & Simulation by AKESSON, Bernt M, LAPPI, Esa, PETTERSSON, Ville H, MALMI, Eric, SYRJÄNEN, Sampo, VULLI, Marko, STENIUS, Kari

Get full text

Validating indirect fire models with field experiments by Åkesson, Bernt M., Lappi, Esa, Pettersson, Ville H., Malmi, Eric, Syrjänen, Sampo, Vulli, Marko, Stenius, Kari

“…Field experiments were used to evaluate three different indirect fire models: the cookie cutter and the Carleton damage functions and a simplified physical…”
Get full text

Planar Hypohamiltonian Graphs on 40 Vertices by Jooyandeh, Mohammadreza, McKay, Brendan D, Östergård, Patric R. J, Pettersson, Ville H, Zamfirescu, Carol T

“…A graph is hypohamiltonian if it is not Hamiltonian, but the deletion of any single vertex gives a Hamiltonian graph. Until now, the smallest known planar…”
Get full text