Algorithms for generating convex sets in acyclic digraphs

DOI10.1016/j.jda.2008.07.008zbMath1213.05241OpenAlexW2171507906MaRDI QIDQ1044043

J. Reddington, Anders Yeo, Gregory Gutin, Arezou Soleimanfallah, Paul N. Balister, Elizabeth A. Scott, Adrian Johnstone, Stefanie Gerke

Publication date: 10 December 2009

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2008.07.008

zbMATH Keywords

convex setsacyclic digraphsembedded processorsenumeration algorithms

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Computer system organization (68M99) Directed graphs (digraphs), tournaments (05C20) General convexity (52A99)

Related Items (3)

An algorithm for finding input-output constrained convex sets in an acyclic digraph ⋮ Convex sets in acyclic digraphs ⋮ Acyclic Digraphs

Uses Software

• MiBench

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matrix multiplication via arithmetic progressions
• On the number of connected convex subgraphs of a connected acyclic digraph
• Automatic application-specific instruction-set extensions under microarchitectural constraints
• Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
• Finding All Spanning Trees of Directed and Undirected Graphs
• An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
• Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
• EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH

This page was built for publication: Algorithms for generating convex sets in acyclic digraphs