Listing Acyclic Orientations of Graphs with Single and Multiple Sources

Abstract : We study enumeration problems for the acyclic orientations of an undirected graph with n nodes and m edges, where each edge must be assigned a direction so that the resulting directed graph is acyclic. When the acyclic orientations have single or multiple sources specified as input along with the graph, our algorithm is the first one to provide guaranteed bounds, giving new bounds with a delay of O(m⋅n) time per solution and O(n2) working space. When no sources are specified, our algorithm improves over previous work by reducing the delay to O(m), and is the first one with linear delay.
Document type :
Conference papers
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal.inria.fr/hal-01388470
Contributor : Marie-France Sagot <>
Submitted on : Tuesday, May 30, 2017 - 1:52:15 PM
Last modification on : Tuesday, February 26, 2019 - 10:54:02 AM
Long-term archiving on : Wednesday, September 6, 2017 - 1:59:54 PM

File

EnumeratingAcyclicOrientations...
Files produced by the author(s)

Identifiers

Collections

Citation

Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi. Listing Acyclic Orientations of Graphs with Single and Multiple Sources. LATIN 2016: Theoretical Informatics - 12th Latin American Symposium, Apr 2016, Ensenada, Mexico. pp.319-333, ⟨10.1007/978-3-662-49529-2_24⟩. ⟨hal-01388470⟩

Share

Metrics

Record views

160

Files downloads

189