default search action
Alain Bretto
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j26]Isabelle Bloch, Alain Bretto:
Functional analysis on hypergraphs: Density and zeta functions - applications to molecular graphs and image analysis. Inf. Sci. 676: 120850 (2024) - 2020
- [j25]Alain Bretto, Alain Faisant, François Hennecart:
On hyperedge coloring of weakly trianguled hypergraphs and well ordered hypergraphs. Discret. Math. 343(11): 112059 (2020)
2010 – 2019
- 2019
- [j24]Rafic Nader, Alain Bretto, Bassam Mourad, Hassan Abbas:
On the positive semi-definite property of similarity matrices. Theor. Comput. Sci. 755: 13-28 (2019) - [c23]David Batista Soares, Alain Bretto, Joel Priolon:
Flows of information have changed: Do financial markets remain efficient ? CIFEr 2019: 1-8 - [c22]Isabelle Bloch, Alain Bretto:
A New Entropy for Hypergraphs. DGCI 2019: 143-154 - 2018
- [j23]Mohamad Badaoui, Alain Bretto, David Ellison, Bassam Mourad:
On constructing expander families of G-graphs. Ars Math. Contemp. 15(2): 425-440 (2018) - 2015
- [j22]Isabelle Bloch, Alain Bretto:
Corrigendum to "Mathematical morphology on hypergraphs, application to similarity and positive kernel" [Comput. Vis. Image Understanding 117 (2013) 342-354]. Comput. Vis. Image Underst. 132: 1-2 (2015) - [j21]Isabelle Bloch, Alain Bretto, Aurélie Leborgne:
Robust similarity between hypergraphs based on valuations and mathematical morphology operators. Discret. Appl. Math. 183: 2-19 (2015) - 2014
- [j20]Aurélien Ducournau, Alain Bretto:
Random walks in directed hypergraphs and application to semi-supervised image segmentation. Comput. Vis. Image Underst. 120: 91-102 (2014) - 2013
- [j19]Isabelle Bloch, Alain Bretto:
Mathematical morphology on hypergraphs, application to similarity and positive kernel. Comput. Vis. Image Underst. 117(4): 342-354 (2013) - [j18]Alain Bretto, Yannick Silvestre, Thierry Vallée:
Factorization of products of hypergraphs: Structure and algorithms. Theor. Comput. Sci. 475: 47-58 (2013) - [c21]Isabelle Bloch, Alain Bretto, Aurélie Leborgne:
Similarity between Hypergraphs Based on Mathematical Morphology. ISMM 2013: 1-12 - 2012
- [j17]Aurélien Ducournau, Alain Bretto, Soufiane Rital, Bernard Laget:
A reductive approach to hypergraph clustering: An application to image segmentation. Pattern Recognit. 45(7): 2788-2803 (2012) - [c20]Alain Bretto, Joel Priolon:
A new approach to asset pricing with rational agents behaving strategically. CIFEr 2012: 1-7 - 2011
- [j16]Alain Bretto, Alain Faisant, Luc Gillibert:
New graphs related to (p, 6) and (p, 8)-cages. Comput. Math. Appl. 62(6): 2472-2479 (2011) - [j15]Thierry Vallée, Alain Bretto:
A new closure concept preserving graph Hamiltonicity and based on neighborhood equivalence. Discret. Math. 311(5): 336-341 (2011) - [j14]Alain Bretto, Alain Faisant:
Cayley graphs and G-graphs: Some applications. J. Symb. Comput. 46(12): 1403-1412 (2011) - [c19]Isabelle Bloch, Alain Bretto:
Mathematical Morphology on Hypergraphs: Preliminary Definitions and Results. DGCI 2011: 429-440 - 2010
- [c18]Alain Bretto, Aurélien Ducournau, Soufiane Rital:
A Hypergraph Reduction Algorithm for Joint Segmentation and Classification of Satellite Image Content. CIARP 2010: 38-45 - [c17]Alain Bretto, Yannick Silvestre:
Factorization of Cartesian Products of Hypergraphs. COCOON 2010: 173-181
2000 – 2009
- 2009
- [j13]Luc Gillibert, Alain Bretto:
Hypergraphs for Generic Lossless Image Compression. Fundam. Informaticae 91(3-4): 533-546 (2009) - [j12]Alain Bretto, Thierry Vallée:
A clique-covering sufficient condition for hamiltonicity of graphs. Inf. Process. Lett. 109(20): 1156-1160 (2009) - [c16]Alain Bretto, Yannick Silvestre, Thierry Vallée:
Cartesian product of hypergraphs: properties and algorithms. ACAC 2009: 22-28 - 2008
- [j11]Alain Bretto, Luc Gillibert:
G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs. Discret. Appl. Math. 156(14): 2719-2739 (2008) - [j10]Alain Bretto, Cerasela Jaulin, Kevin G. Kirby, Bernard Laget:
G-Graphs and Algebraic Hypergraphs. Electron. Notes Discret. Math. 30: 153-158 (2008) - [c15]Thierry Vallée, Alain Bretto:
Hamiltonicity of Simplicial-Connected Graphs: An Algorithm Based on Clique Decomposition. ITNG 2008: 904-909 - 2007
- [j9]Céline Hébert, Alain Bretto, Bruno Crémilleux:
A Data Mining Formalization to Improve Hypergraph Minimal Transversal Computation. Fundam. Informaticae 80(4): 415-433 (2007) - [j8]Alain Bretto, Alain Faisant, Luc Gillibert:
G-graphs: A new representation of groups. J. Symb. Comput. 42(5): 549-560 (2007) - [c14]Alain Bretto, Cerasela Jaulin, Luc Gillibert, Bernard Laget:
A New Property of Hamming Graphs and Mesh of d-ary Trees. ASCM 2007: 139-150 - [c13]Alain Bretto, Luc Gillibert:
G-graphs for the cage problem: a new upper bound. ISSAC 2007: 49-53 - [c12]Luc Gillibert, Alain Bretto:
Hypergraphs for Near-lossless Volumetric Compression. ITNG 2007: 229-233 - [c11]Céline Hébert, Alain Bretto, Bruno Crémilleux:
Optimizing hypergraph transversal computation with an anti-monotone constraint. SAC 2007: 443-444 - [p1]Alain Bretto:
Digital Topologies on Graphs. Applied Graph Theory in Computer Vision and Pattern Recognition 2007: 65-82 - 2006
- [j7]Alain Bretto:
Hypergraphs and the Helly property. Ars Comb. 78 (2006) - [j6]Alain Bretto, Alain Faisant, Thierry Vallée:
Compatible topologies on graphs: An application to graph isomorphism problem complexity. Theor. Comput. Sci. 362(1-3): 255-272 (2006) - [c10]Luc Gillibert, Alain Bretto:
Near-Lossless 3D-image Compression Using Hypergraphs. DCC 2006: 450 - 2005
- [j5]Alain Bretto, Luc Gillibert:
Symmetry and connectivity in G-graphs. Electron. Notes Discret. Math. 22: 481-486 (2005) - [c9]Alain Bretto, Luc Gillibert:
Hypergraph-Based Image Representation. GbRPR 2005: 1-11 - [c8]Alain Bretto, Luc Gillibert, Bernard Laget:
Symmetric and semisymmetric graphs construction using G-graphs. ISSAC 2005: 61-67 - [c7]Alain Bretto, Luc Gillibert:
Hypergraph Lossless Image Compression. ITCC (1) 2005: 46-50 - 2004
- [c6]Alain Bretto, Luc Gillibert:
Graphical and Computational Representation of Groups. International Conference on Computational Science 2004: 343-350 - 2002
- [j4]Alain Bretto, Stéphane Ubéda, Janez Zerovnik:
A polynomial algorithm for the strong Helly property. Inf. Process. Lett. 81(1): 55-57 (2002) - [j3]Alain Bretto, Hocine Cherifi, Driss Aboutajdine:
Hypergraph imaging: an overview. Pattern Recognit. 35(3): 651-658 (2002) - [c5]S. Chastel, Philippe Colantoni, Alain Bretto:
Displaying Image Neighborhood Hypergraphs Line-Graphs. DGCI 2002: 124-135 - 2001
- [j2]Alain Bretto:
Comparability Graphs and Digital Topology. Comput. Vis. Image Underst. 82(1): 33-41 (2001) - [c4]Soufiane Rital, Alain Bretto, Driss Aboutajdine, Hocine Cherifi:
Application of Adaptive Hypergraph Model to Impulsive Noise Detection. CAIP 2001: 555-562 - [c3]Alain Bretto, Hocine Cherifi, Stéphane Ubéda:
An efficient algorithm for Helly property recognition in a linear hypergraph. IWCIA 2001: 177-187 - 2000
- [c2]Alain Bretto, Hocine Cherifi:
Noise Detection and Cleaning by Hypergraph Model. ITCC 2000: 416-421
1990 – 1999
- 1997
- [j1]Alain Bretto, J. Azema, Hocine Cherifi, Bernard Laget:
Combinatorics and Image Processing. CVGIP Graph. Model. Image Process. 59(5): 265-277 (1997) - 1996
- [c1]Alain Bretto, Stéphane Ubéda:
Hypergraph model of digital topology for grey level images. DGCI 1996: 217-226
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint