Large hypergraphs of diameter one

Autor:	Bermond, Jean-Claude, Bond, Johny, Saclé, Jean-François
Přispěvatelé:	Laboratoire de Recherche en Informatique (LRI), Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), Graphes, Algorithmes et Combinatoire (LRI) (GALaC - LRI), Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), Bermond, Jean-Claude
Jazyk:	angličtina
Rok vydání:	1984
Předmět:	[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM] [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI] [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI] [INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO] [INFO.INFO-SI] Computer Science [cs]/Social and Information Networks [cs.SI] [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS] [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS] [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO] [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM] ComputingMilieux_MISCELLANEOUS [INFO.INFO-SI]Computer Science [cs]/Social and Information Networks [cs.SI]
Zdroj:	Graph theory and Combinatorics, Academic Press Graph theory and Combinatorics, Academic Press, 1984, Cambridge, United Kingdom. pp.19-28
Popis:	International audience
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::d74a5f3ce65298da884a4292334c65e2 https://hal.inria.fr/hal-02447161/document Zobrazit plný text záznamu