Graph-theoretical properties of parallelism in the digital plane
type: Item
instance of: scholarly article
title: Graph-theoretical properties of parallelism in the digital plane
zbMATH Open document ID: 1010.68191
DOI: 10.1016/S0166-218X(02)00228-7
author: Peter Veelaert
published in: Discrete Applied Mathematics
publication date: 2003-03-09T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68U10
zbMATH DE Number: 1878516
zbMATH Keywords: digital parallelism
zbMATH Keywords: perceptual grouping
zbMATH Keywords: interval graphs
zbMATH Keywords: digital geometry
MaRDI profile type: Publication
cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
cites work: Geometric algorithms and combinatorial optimization.
cites work: Morphological sampling
cites work: Solvability and Consistency for Linear Equations and Inequalities
cites work: Preserving topology by a digitization process
cites work: Q4948843
cites work: Discretization in Hausdorff space
cites work: Q5603731
cites work: Geometric constructions in the digital plane
cites work: Q4869540
Recommended article: Parallel computations on a graph
Recommended article: Q4429423
Recommended article: Parallel computations on graphs
Recommended article: Parallel algorithms for parity graphs
Recommended article: On the parallel complexity of digraph reachability
Recommended article: Q3340125
Recommended article: Q3683547
Recommended article: Parallel concepts in graph theory
Recommended article: A digraph theoretic parallelism in block methods
Recommended article: Parallel graph algorithms for hypercube computers
description: scientific article; zbMATH DE number 1878516