Closure operators on graphs for modeling connectedness in digital spaces
From MaRDI portal
Publication:5088067
Recommendations
- Path-induced closure operators on graphs for defining digital Jordan surfaces
- A closure operator for the digital plane
- Path-set induced closure operators on graphs
- Categorical aspects of inducing closure operators on graphs by sets of walks
- A Jordan curve theorem with respect to certain closure operations on the digital plane
Cites work
- A compression of digital images derived from a Khalimsky topological structure
- A Jordan surface theorem for three-dimensional digital spaces
- A theory of binary digital pictures
- A Topological Approach to Digital Topology
- Closure operations for digital topology.
- Computer graphics and connected topologies on finite ordered sets
- Connectivity in Digital Pictures
- Digital Topology
- Graph multiplication
- Graphs with a path partition for structuring digital spaces
- scientific article; zbMATH DE number 3267917 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- Jordan curve theorems with respect to certain pretopologies on \(\mathbb Z^2\)
- Path-set induced closure operators on graphs
Cited in
(12)- Relation-induced connectedness in the digital plane
- Galois connections between sets of paths and closure operators in simple graphs
- Categorical aspects of inducing closure operators on graphs by sets of walks
- Connectivity with respect to \(\alpha\)-discrete closure operators
- Path-induced closure operators on graphs for defining digital Jordan surfaces
- Terse walk sets in graphs and induced closure operators
- Convenient closure operators on Z^2
- scientific article; zbMATH DE number 6897325 (Why is no real title available?)
- Digital Jordan curves and surfaces with respect to a closure operator
- A closure operator for the digital plane
- Closure operators associated with networks
- Path-set induced closure operators on graphs
This page was built for publication: Closure operators on graphs for modeling connectedness in digital spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088067)