Preclusivity and simple graphs: the n-cycle and n-path cases
DOI10.1007/978-3-319-25783-9_13zbMATH Open1444.68200OpenAlexW2295674735MaRDI QIDQ3300263FDOQ3300263
Authors: Davide Ciucci, F. Infusino, G. Chiaselotti, T. Gentile
Publication date: 28 July 2020
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-25783-9_13
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Reasoning under uncertainty in the context of artificial intelligence (68T37) Knowledge representation (68T30) Paths and cycles (05C38)
Cites Work
- Graph theory
- Title not available (Why is that?)
- The structure of oppositions in rough set theory and formal concept analysis -- toward a new bridge between the two settings
- Title not available (Why is that?)
- Generalized rough sets (preclusivity fuzzy-intuitionistic (BZ) lattices)
- Simple Undirected Graphs as Formal Contexts
- Preclusivity and Simple Graphs
Cited In (7)
- The adjacency matrix of a graph as a data table: a geometric perspective
- Dependency and accuracy measures for directed graphs
- Notions from rough set theory in a generalized dependency relation context
- Dependency structures for decision tables
- Indiscernibility structures induced from function sets : Graph and digraph case
- Preclusivity and Simple Graphs
- Decision systems in rough set theory: A set operatorial perspective
This page was built for publication: Preclusivity and simple graphs: the \(n\)-cycle and \(n\)-path cases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3300263)