Closure systems and their structure

DOI10.1016/S0020-0255(01)00169-4zbMath0993.06004MaRDI QIDQ1602560

Robert E. Jamison, John L. Pfaltz

Publication date: 23 June 2002

Published in: Information Sciences (Search for Journal in Brave)

zbMATH Keywords

coveringgraphsclosure operatorsdigital image processingdominationpseudo-convexityantimatroid closure spaces

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Related Items (10)

Generating and enumerating digitally convex sets of trees ⋮ A new notion of convexity in digraphs with an application to Bayesian networks ⋮ ``Viral Turing machines, computation from noise and combinatorial hierarchies ⋮ Towards a new framework for domination ⋮ New representations of algebraic domains and algebraic L-domains via closure systems ⋮ Transformations of Concept Graphs: ⋮ Violator spaces vs closure spaces ⋮ Unnamed Item ⋮ On geometric posets and partial matroids ⋮ Moore systems and Moore convergence classes of families of nets

Cites Work

• A use for frequently rediscovering a concept
• Greedoids
• The theory of convex geometries
• Tensorial decomposition of concept lattices
• Combinatorial representation and convex dimension of convex geometries
• Chordal graphs and upper irredundance, upper domination and independence
• Closure lattices
• Critical concepts in domination
• Recent problems and results about kernels in directed graphs
• Convexity in Graphs and Hypergraphs
• “Convexity” of sets of lines
• Relational Methods in Computer Science
• Sequential Operations in Digital Picture Processing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Closure systems and their structure