And/or-convexity: a graph convexity based on processes and deadlock models
type: Item
instance of: scholarly article
title: And/or-convexity: a graph convexity based on processes and deadlock models
zbMATH Open document ID: 1388.05050
author: Fábio Protti
author: Dieter Rautenbach
author: Uéverton S. Souza
author: Carlos Vinícius G. C. Lima
author: Jayme L. Szwarcfiter
published in: Annals of Operations Research
publication date: 2018-06-12T00:00:00Z
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C82
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68M14
zbMATH DE Number: 6886497
zbMATH Keywords: graph convexity
zbMATH Keywords: deadlock
zbMATH Keywords: AND-OR model
zbMATH Keywords: and/or graphs
MaRDI profile type: Publication
full work available at URL: s10479-017-2666-1
OpenAlex ID: W2764281430
cites work: Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
cites work: On the hull number of some graph classes
cites work: Complexity aspects of the computation of the rank of a graph
cites work: A two-level distributed detection algorithm of AND/OR deadlocks
cites work: Dominating sets for split and bipartite graphs
cites work: Q5422499
cites work: On geodetic sets formed by boundary vertices
cites work: Graphs with few \(P_4\)'s under the convexity of paths of order three
cites work: A linear algorithm for the domination number of a tree
cites work: The Carathéodory number of the \(P_3\) convexity of chordal graphs
cites work: Q5633643
cites work: Q3651735
cites work: Revisiting the complexity of and/or graph solution
cites work: On the computation of the hull number of a graph
cites work: Complexity results related to monophonic convexity
cites work: Characterization and recognition of Radon-independent sets in split graphs
cites work: The Parametrized Complexity of Some Fundamental Problems in Coding Theory
cites work: Completeness in approximation classes beyond APX
cites work: A randomized competitive algorithm for evaluating priced AND/OR trees
cites work: A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
cites work: Computationally Related Problems
cites work: On the Optimal Solutions to AND/OR Series-Parallel Graphs
DOI: 10.1007/S10479-017-2666-1
description: scientific article; zbMATH DE number 6886497