Closure systems and their structure

Information Sciences

Volumn 139, Issue 3-4, 2001, Pages 275-286

  Pfaltz, John L ^a   Jamison, Robert E ^b  

^a University of Virginia   (United States)

^b CLEMSON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; IMAGE PROCESSING;

TRANSITIVE CLOSURES;

INFORMATION SCIENCE;

EID: 0035577323     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(01)00169-4     Document Type: Conference Paper

References (30)

1. Direct transitive closure algorithms: Design and performance evaluation
2. Recent problems and results about kernels in directed graphs
3. Convexity of sets of lines
4. A transitive closure for test generation
5. Families minimales d'implications informatives resultant d'un tableau de donneee binaires
6. The theory of convex geometries
7. Combinatorial representation and convex dimension of convex geometries
8. Convexity in graphs and hypergraphs
9. When is a set of lines in space convex?
10. Finding convex edge groupings in an image
11. Transitive closure algorithms based on graph traversal
12. Chordal graphs and upper irredundance, upper domination and independence
13. Monotactic matroids
14. Convexity and block graphs
15. A perspective on abstract convexity: Classifying alignments by varieties
16. A use for frequently rediscovering a concept
17. n
18. Partition coefficients of acyclic graphs
19. Closure lattices
20. Computer representation of planar regions by their skeletons
21. Sequential operations in digital picture processing
22. Distance functions on digital pictures
23. Matching hierarchical structures using association graphs
24. Critical concepts in domination
25. Tensorial decomposition of concept lattices