Representing a concept lattice by a graph
From MaRDI portal
Redirect page
Redirect to:
Recommendations
Cites work
- scientific article; zbMATH DE number 4016967 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 1249514 (Why is no real title available?)
- scientific article; zbMATH DE number 1305489 (Why is no real title available?)
- scientific article; zbMATH DE number 1500572 (Why is no real title available?)
- scientific article; zbMATH DE number 1931756 (Why is no real title available?)
- scientific article; zbMATH DE number 3245483 (Why is no real title available?)
- scientific article; zbMATH DE number 3307330 (Why is no real title available?)
- scientific article; zbMATH DE number 3420808 (Why is no real title available?)
- A fast algorithm for building lattices
- Asteroidal triples of moplexes
- Decomposition by clique separators
- Efficient enumeration of all minimal separators in a graph
- Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs
- GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
- Galois lattice as a framework to specify building class hierarchies algorithms
- How to use the minimal separators of a graph for its chordal triangulation
- Listing all Minimal Separators of a Graph
- On Halin-lattices in graphs
- On rigid circuit graphs
- Optimal decomposition by clique separators
- Parallel data mining for association rules on shared-memory systems
- Representation of a finite graph by a set of intervals on the real line
- Schnittverbände in Graphen. (Intersection lattices in graphs)
- Separability generalizes Dirac's theorem
- Treillis de Séparation des Graphes
- Triangulating graphs without asteroidal triples
- Two basic algorithms in concept analysis
- Weak Separation Lattices of Graphs
- Über trennende Eckenmengen in Graphen und den Mengerschen Satz
Cited in
(29)- Morphological Links Between Formal Concepts and Hypergraphs
- Medical diagnoses using three-way fuzzy concept lattice and their Euclidean distance
- Complex vague set based concept lattice
- Horn representation of a concept lattice
- Vague concept lattice reduction using granular computing and vague entropy
- Representing a concept lattice by neighborly ideas
- Some classifications of graphs with respect to a set adjacency relation
- A note on bipolar fuzzy graph representation of concept lattice
- scientific article; zbMATH DE number 4072452 (Why is no real title available?)
- scientific article; zbMATH DE number 5557951 (Why is no real title available?)
- Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph
- A peep through the looking glass: articulation points in lattices
- Characterising \((k,\ell )\)-leaf powers
- Generalized domination in closure systems
- Bipolar fuzzy graph representation of concept lattice
- An approach to access to a concept lattice via the idea of lattice theory
- Comparison of k-creature and t-critter
- Rough fuzzy concept lattice and its properties
- Describing hierarchy of concept lattice by using matrix
- scientific article; zbMATH DE number 1405764 (Why is no real title available?)
- Concept lattices as a search space for graph compression
- A rough set method for the vertex cover problem in graph theory
- Fuzzy graph representation of a fuzzy concept lattice
- A local approach to concept generation
- Representing attribute reduction and concepts in concept lattice using graphs
- Bipartite Ferrers-Graphs and Planar Concept Lattices
- scientific article; zbMATH DE number 4160798 (Why is no real title available?)
- Breadth first search graph partitions and concept lattices
- Knowledge representation using interval-valued fuzzy formal concept lattice
This page was built for publication: Representing a concept lattice by a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1885806)
