Algorithms for generating convex sets in acyclic digraphs
type: Item
instance of: scholarly article
title: Algorithms for generating convex sets in acyclic digraphs
zbMATH Open document ID: 1213.05241
author: G. Gutin
author: J. Reddington
author: A. Yeo
author: Paul Balister
author: Stefanie Gerke
author: A. Johnstone
author: E. Scott
author: Arezou Soleimanfallah
published in: Journal of Discrete Algorithms
publication date: 2009-12-10T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 68M99
Mathematics Subject Classification ID: 52A99
zbMATH DE Number: 5645013
zbMATH Keywords: convex sets
zbMATH Keywords: acyclic digraphs
zbMATH Keywords: enumeration algorithms
zbMATH Keywords: embedded processors
describes a project that uses: MiBench
MaRDI profile type: Publication
full work available at URL: j.jda.2008.07.008
OpenAlex ID: W2171507906
cites work: Automatic application-specific instruction-set extensions under microarchitectural constraints
cites work: Matrix multiplication via arithmetic progressions
cites work: Q4393480
cites work: Q5616737
cites work: Finding All Spanning Trees of Directed and Undirected Graphs
cites work: On the number of connected convex subgraphs of a connected acyclic digraph
cites work: Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
cites work: Q4234989
cites work: Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
cites work: EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH
cites work: An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
DOI: 10.1016/J.JDA.2008.07.008
description: scientific article; zbMATH DE number 5645013