Generating the Acyclic Orientations of a Graph
From MaRDI portal
Publication:4386449
DOI10.1006/JAGM.1997.0891zbMATH Open0894.68106OpenAlexW1980593972MaRDI QIDQ4386449FDOQ4386449
Authors: Matthew B. Squire 
Publication date: 26 April 1998
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1997.0891
Recommendations
Cited In (17)
- Title not available (Why is that?)
- Enumerating \(k\)-arc-connected orientations
- Exact periodic wave solutions for the modified Zakharov equations with a quantum correction
- Polynomial algorithms for canonical forms of orientations
- Efficient enumeration of drawings and combinatorial structures for maximal planar graphs
- On extensions, linear extensions, upsets and downsets of ordered sets
- FPT algorithms to enumerate and count acyclic and totally cyclic orientations
- Generating all the acyclic orientations of an undirected graph
- Occurrences of reciprocal sign epistasis in single- and multi-peaked theoretical fitness landscapes
- Efficient enumeration of graph orientations with sources
- Finding an unknown acyclic orientation of a given graph
- 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
- On enumerating all minimal solutions of feedback problems
- Enumerating cyclic orientations of a graph
- Acyclic reorientation lattices and their lattice quotients
This page was built for publication: Generating the Acyclic Orientations of a Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4386449)
