Pages that link to "Item:Q5255665"

The following pages link to Simple Undirected Graphs as Formal Contexts (Q5255665):

Displaying 10 items.

• New rough approximations for \(n\)-cycles and \(n\)-paths (Q670991) (← links)
• Simple graphs in granular computing (Q1671713) (← links)
• The granular partition lattice of an information table (Q2293047) (← links)
• The adjacency matrix of a graph as a data table: a geometric perspective (Q2362877) (← links)
• Dependency structures for decision tables (Q2411274) (← links)
• Dependency and accuracy measures for directed graphs (Q2423026) (← links)
• Preclusivity and Simple Graphs (Q3300262) (← links)
• Preclusivity and Simple Graphs: The n–cycle and n–path Cases (Q3300263) (← links)
• Rough Set Theory Applied to Simple Undirected Graphs (Q3300371) (← links)
• Indiscernibility structures induced from function sets : Graph and digraph case (Q5031926) (← links)