Generalized domination in closure systems

DOI10.1016/J.DAM.2005.04.009MaRDI QIDQ2489652zbMATH OpenOpenAlexFDO

Authors Anne Berry, Eric Sanjuan, Alain Sigayret

Publication date 28 April 2006

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2005.04.009

zbMATH Keywords

Functional dependenciesGraph TheoryPrime implicatesFinite closure systemsFinite latticesPropositional Horn functions

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Galois correspondences, closure operators (in relation to ordered sets) (06A15) Database theory (68P15)

Recommendations

• Generalized set dominating and separating systems
• Closed domination in graphs
• Generalized dominators
• On extending closure systems to matroids
• A continuous generalization of domination-like invariants
• Generalized closed sets: a unified approach
• A generalization of Vizing's theorem on domination
• Closure systems on \(L\)-ordered sets
• Closure under Convolution of Dominance Relations

Cites work

• scientific article; zbMATH DE number 4016967 (Why is no real title available?)
• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 3823168 (Why is no real title available?)
• scientific article; zbMATH DE number 3915664 (Why is no real title available?)
• scientific article; zbMATH DE number 3771669 (Why is no real title available?)
• scientific article; zbMATH DE number 1931756 (Why is no real title available?)
• scientific article; zbMATH DE number 2101414 (Why is no real title available?)
• scientific article; zbMATH DE number 7635224 (Why is no real title available?)
• scientific article; zbMATH DE number 3204690 (Why is no real title available?)
• scientific article; zbMATH DE number 3420808 (Why is no real title available?)
• Algorithmic Aspects of Vertex Elimination on Graphs
• Galois lattice as a framework to specify building class hierarchies algorithms
• Horn functions and their DNFs
• LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Representing a concept lattice by a graph
• The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
• The poset of closures as a model of changing databases
• Two basic algorithms in concept analysis

Cited in

(2)

• Horn representation of a concept lattice
• The multiple facets of the canonical direct unit implicational basis

Describes a project that uses

Uses Software

• Ltur

This page was built for publication: Generalized domination in closure systems

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