Autor:	Uros Cibej, Jurij Mihelič
Rok vydání:	2017
Předmět:	Discrete mathematics Modular decomposition Indifference graph Pathwidth Dense graph Chordal graph Cograph 1-planar graph Graph product MathematicsofComputing_DISCRETEMATHEMATICS Mathematics
Zdroj:	DCC
DOI:	10.1109/dcc.2017.20
Popis:	This article describes an alternative representation of graphs, using symmetries. We define the class of graphs that are compressed using this representation as symmetry-compressible graphs. This class of graphs is extended into the class of near symmetry-compressible graphs, which includes many more graphs arising in practical applications. To demonstrate the practical potential of the proposed concepts, an empirical evaluation of two algorithms is given.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::10a6ba1e3783012da76634818f2e5331 https://doi.org/10.1109/dcc.2017.20 Zobrazit plný text záznamu