Generating all the acyclic orientations of an undirected graph
From MaRDI portal
Publication:294704
DOI10.1016/S0020-0190(99)00120-9zbMATH Open1339.05379WikidataQ127548920 ScholiaQ127548920MaRDI QIDQ294704FDOQ294704
Authors: Valmir C. Barbosa, Jayme L. Szwarcfiter 
Publication date: 16 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019099001209?np=y
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)
Cites Work
Cited In (16)
- Enumerating \(k\)-arc-connected orientations
- Efficient enumeration of drawings and combinatorial structures for maximal planar graphs
- On extensions, linear extensions, upsets and downsets of ordered sets
- The size distribution for Markov equivalence classes of acyclic digraph models.
- FPT algorithms to enumerate and count acyclic and totally cyclic orientations
- Efficient enumeration of graph orientations with sources
- A note on orientation and chromatic number of graphs
- A supernodal formulation of vertex colouring with applications in course timetabling
- Acyclic reorientation lattices and their lattice quotients
- Combinatorial Generation via Permutation Languages. V. Acyclic Orientations
- Listing Acyclic Orientations of Graphs with Single and Multiple Sources
- Enumerating cyclic orientations of a graph
- Acyclic reorientation lattices and their lattice quotients
- Listing acyclic subgraphs and subgraphs of bounded girth in directed graphs
- Algorithms for media
- The representation of partially-concurrent open shop problems
This page was built for publication: Generating all the acyclic orientations of an undirected graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294704)
