Search for Author All Reviews
	Bretto, Alain     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 4 of 4 reviews       Random walks in directed hypergraphs and application to semi-supervised image segmentation Ducournau A., Bretto A. Computer Vision and Image Understanding 12091-102, 2014.  Type: Article Hypergraphs are generalizations of graphs. In conventional graphs, the vertex set is partitioned into a number of pairs called edges. In hypergraphs, the vertex set is partitioned into a number of hyperedges with possibly more than two...... Jul 14 2015     Hypergraph theory: an introduction Bretto A., Springer Publishing Company, Incorporated, Cham, Switzerland, 2013. 132 pp.  Type: Book (978-3-319000-79-4) As the title suggests, this book addresses the mathematics and theory of hypergraphs. The target audience includes graduate students and researchers with an interest in math and computer science (CS)....... Jan 28 2014     G-graphs: a new representation of groups Bretto A., Faisant A., Gillibert L. Journal of Symbolic Computation 42(5): 549-560, 2007.  Type: Article Given a finite group G having a set of generators S, the authors of this paper define a finite graph &PHgr;(G,S), both mathematically and algorithmically. Properties of these...... Oct 29 2007     Symmetric and semisymmetric graphs construction using G-graphs Bretto A., Gillibert L., Laget B.  Symbolic and algebraic computation (Proceedings of the 2005 International Symposium on Symbolic and Algebraic Computation, Beijing, China, Jul 24-27, 2005) 61-67, 2005.  Type: Proceedings A graph that is both edge-transitive and vertex-transitive is called a symmetric graph. A graph that is edge-transitive, but not vertex-transitive is called a semisymmetric graph. Constructing symmetric and semisymmetric graphs is a la...... Oct 3 2005
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy