A representation for the modules of a graph and applications
AUTOR(ES)
Klein, Sulamita, Szwarcfiter, Jaime L.
FONTE
Journal of the Brazilian Computer Society
DATA DE PUBLICAÇÃO
2003-11
RESUMO
We describe a simple representation for the modules of a graph G. We show that the modules of G are in one-to-one correspondence with the ideals of certain posets. These posets are characterized and shown to be layered posets, that is, transitive closures of bipartite tournaments. Additionaly, we describe applications of the representation. Employing the above correspondence, we present methods for solving the following problems: (i) generate all modules of G, (ii) count the number of modules of G, (iii) find a maximal module satisfying some hereditary property of G and (iv) find a connected non-trivial module of G.
Documentos Relacionados
- Graph-representation of oxidative folding pathways
- A Well Stated Time Domain Integral Representation for Elastodynamic Analysis and Applications
- Spectral Profiles, a Novel Representation of Tandem Mass Spectra and Their Applications for de Novo Peptide Sequencing and Identification*S⃞
- A Graph for Standard Errors of Ratios
- A linear graph for digoxin radioimmunoassay.
