Affiner les résultats

Degree-constrained edge partitioning in graphs arising from discrete tomography

Bentz, Cédric ; Costa, Marie-Christine ; Picouleau, Christophe ; Ries, Bernard ; de Werra, Dominique

In: Journal of Graph Algorithms and Applications, 2009, vol. 13, no. 2, p. 99-118

Starting from the basic problem of reconstructing a 2-dimensional im- age given by its projections on two axes, one associates a model of edge coloring in a complete bipartite graph. The complexity of the case with k = 3 colors is open. Variations and special cases are considered for the case k = 3 colors where the graph corresponding to the union of some color classes (for instance colors 1...

Evaluation of a prototype correction algorithm to reduce metal artefacts in flat detector computed tomography of scaphoid fixation screws

Filli, Lukas ; Marcon, Magda ; Scholz, Bernhard ; Calcagni, Maurizio ; Finkenstädt, Tim ; Andreisek, Gustav ; Guggenberger, Roman

In: Skeletal Radiology, 2014, vol. 43, no. 12, p. 1705-1712

How to Guard a Graph?

Fomin, Fedor ; Golovach, Petr ; Hall, Alex ; Mihalák, Matúš ; Vicari, Elias ; Widmayer, Peter

In: Algorithmica, 2011, vol. 61, no. 4, p. 839-856

Optimistic chordal coloring: a coalescing heuristic forSSAform programs

Brisk, Philip ; Verma, Ajay ; Ienne, Paolo

In: Design Automation for Embedded Systems, 2009, vol. 13, no. 1-2, p. 115-137

Sampling Trees from Evolutionary Models

Hartmann, Klaas ; Wong, Dennis ; Stadler, Tanja

In: Systematic Biology, 2010, vol. 59, no. 4, p. 465-476