FCA in a logical programming setting for visualization-oriented graph compression

DOI10.1007/978-3-319-59271-8_6MaRDI QIDQ2399920zbMATH OpenOpenAlexFDO

Authors Lucas Bourneuf, Jacques Nicolas

Publication date 25 August 2017

Full work available at URL https://doi.org/10.1007/978-3-319-59271-8_6

zbMATH Keywords

bioinformaticsgraph compressiongraph visualizationASP

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Knowledge representation (68T30) Logic programming (68N17) Computational methods for problems pertaining to biology (92-08)

Recommendations

• Compression of Graphical Structures: Fundamental Limits, Algorithms, and Experiments
• Reachability preserving compression for dynamic graph
• Functional Compression Through Graph Coloring
• Graph-FCA in practice
• Concept lattices as a search space for graph compression
• scientific article; zbMATH DE number 1555964
• scientific article; zbMATH DE number 219218
• A novel graphical technique for combinational logic representation and optimization

Cited in

(3)

• Formalizing and enriching phenotype signatures using Boolean networks
• Conceptual Structures at Work
• Formal concept analysis: from knowledge discovery to knowledge processing

This page was built for publication: FCA in a logical programming setting for visualization-oriented graph compression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2399920)