An algorithm of polynomial order for computing the covering dimension of a finite space
type: Item
instance of: scholarly article
title: An algorithm of polynomial order for computing the covering dimension of a finite space
zbMATH Open document ID: 1410.54038
published in: Applied Mathematics and Computation
publication date: 2018-06-21T00:00:00Z
Mathematics Subject Classification ID: 54F45
zbMATH DE Number: 6892886
zbMATH Keywords: algorithm of polynomial order
zbMATH Keywords: covering dimension
zbMATH Keywords: finite space
zbMATH Keywords: incidence matrix
author: Dimitris Georgiou
author: Athanasios Megaritis
MaRDI profile type: Publication
full work available at URL: j.amc.2013.12.185
OpenAlex ID: W2051009663
cites work: Duality and finite spaces
cites work: On finite \(T_0\) topological spaces
cites work: Q4855460
cites work: Dimensional properties of graphs and digital spaces.
cites work: Computer programing for construction and enumeration of all regular topologies and equivalence relations on finite sets
cites work: Covering dimension and finite spaces
cites work: On zero dimensional space and its retraction
cites work: Geometry of digital spaces
cites work: Computer graphics and connected topologies on finite ordered sets
cites work: On storage of topological information
cites work: Singular homology groups and homotopy groups of finite topological spaces
cites work: Q5649636
cites work: Q4069959
cites work: Digital Topology
cites work: Dimension of Dense Subalgebras of C(X)
cites work: Q4136160
cites work: Finite Topological Spaces
DOI: 10.1016/J.AMC.2013.12.185
Recommended article: Q3504400
Recommended article: Complexity and approximability of the cover polynomial
Recommended article: Polynomial Space Algorithms for Counting Dominating Sets and the Domatic Number
Recommended article: Algorithmic counting of zero-dimensional finite topological spaces with respect to the covering dimension
Recommended article: Algorithms for polytope covering and approximation
Recommended article: Complexity of the Cover Polynomial
Recommended article: The Pólya algorithm in sequence spaces
Recommended article: A Class of Polynomially Solvable Set-Covering Problems
Recommended article: Q4948642
Recommended article: The Complexity of the Cover Polynomials for Planar Graphs of Bounded Degree
description: scientific article; zbMATH DE number 6892886