Structure and Complexity of 2-Intersection Graphs of 3-Hypergraphs

Autor: Niccoló Di Marco, Andrea Frosini, William Lawrence Kocay, Elisa Pergola, Lama Tarsissi

Publikováno v: Algorithmica. 85:745-761

Given a 3-uniform hypergraph H having a set V of vertices, and a set of hyperedges $$T\subset \mathcal {P}(V)$$ T ⊂ P ( V ) , whose elements have cardinality three each, a null labelling is an assignment of $$\pm 1$$ ± 1 to the hyperedges such tha

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::e46c7c24fdee3cf6cccacfaf583f4f15
https://doi.org/10.1007/s00453-022-00990-4

On null 3-hypergraphs

Autor: Giulia Palma, Andrea Frosini, William L. Kocay, Lama Tarsissi

Publikováno v: Discrete Applied Mathematics
Discrete Applied Mathematics, Elsevier, In press, ⟨10.1016/j.dam.2020.10.020⟩

Given a 3-uniform hypergraph H consisting of a set V of vertices, and T ⊆ V 3 triples, a null labelling is an assignment of ± 1 to the triples such that each vertex is contained in an equal number of triples labelled + 1 and − 1 . Thus, the sign

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3eed82c2972477c41b7dbfa15623aeb2
https://doi.org/10.1016/j.dam.2020.10.020

Further steps on the reconstruction of convex polyominoes from orthogonal projections

Autor: Paolo Dulio, Lama Tarsissi, Simone Rinaldi, Andrea Frosini, Laurent Vuillon

Publikováno v: Journal of Combinatorial Optimization
Journal of Combinatorial Optimization, Springer Verlag, 2021, ⟨10.1007/s10878-021-00751-z⟩

A remarkable family of discrete sets which has recently attracted the attention of the discrete geometry community is the family of convex polyominoes, that are the discrete counterpart of Euclidean convex sets, and combine the constraints of convexi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8ed968f2d748fc773ec24a8694c75a76
https://hal.archives-ouvertes.fr/hal-03225334

Convexity Preserving Contraction of Digital Sets

Autor: Yukiko Kenmochi, Pascal Romon, Lama Tarsissi, David Coeurjolly

Publikováno v: The 5th Asian Conference on Pattern Recognition (ACPR 2019)
The 5th Asian Conference on Pattern Recognition (ACPR 2019), Nov 2019, Auckland, New Zealand. pp.611-624, ⟨10.1007/978-3-030-41299-9_48⟩
Lecture Notes in Computer Science ISBN: 9783030412982
ACPR (2)
ACPR 2019
ACPR 2019, Nov 2019, Auckland, New Zealand

International audience; Convexity is one of the useful geometric properties of digital sets in digital image processing. There are various applications which require deforming digital convex sets while preserving their convexity. In this article, we

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1042fafc03b03fb502c1709fbd8805ef
https://hal.archives-ouvertes.fr/hal-02315084v2/document

First Steps in the Algorithmic Reconstruction of Digital Convex Sets

Autor: Lama Tarsissi, Andrea Frosini, Simone Rinaldi, Laurent Vuillon, Paolo Dulio

Publikováno v: Word
Word, Aug 2017, Montreal, Canada. ⟨10.1007/978-3-319-66396-8⟩
Lecture Notes in Computer Science ISBN: 9783319663951
WORDS

International audience; Digital convex (DC) sets plays a prominent role in the framework of digital geometry providing a natural generalization to the concept of Euclidean convexity when we are dealing with polyominoes, i.e., finite and connected set

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0ef16af130ea183e2fdf559ecaa59e3d
https://hal.archives-ouvertes.fr/hal-02315353/document