Efficient enumeration of graph orientations with sources - Archive ouverte HAL Access content directly
Journal Articles Discrete Applied Mathematics Year : 2018

Efficient enumeration of graph orientations with sources

(1) , (1, 2) , (1, 2) , (3)
1
2
3

Abstract

An orientation of an undirected graph is obtained by assigning a direction to each of its edges. It is called cyclic when a directed cycle appears, and acyclic otherwise. We study efficient algorithms for enumerating the orientations of an undirected graph. To get the full picture, we consider both the cases of acyclic and cyclic orientations, under some rules specifying which nodes are the sources (i.e. their incident edges are all directed outwards). Our enumeration algorithms use linear space and provide new bounds for the delay, which is the maximum elapsed time between the output of any two consecutively listed solutions. We obtain a delay of O(m) for acyclic orientations and ˜Oand˜ and˜O(m) for cyclic ones. When just a single source is specified, these delays become O(m · n) and O(m · h + h 3), respectively, where h is the girth of the graph without the given source. When multiple sources are specified, the delays are the same as in the single source case. .
Fichier principal
Vignette du fichier
1-s2.0-S0166218X1730375X-main.pdf (362.26 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01609009 , version 1 (03-10-2017)

Identifiers

Cite

Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi. Efficient enumeration of graph orientations with sources. Discrete Applied Mathematics, 2018, 246, pp.22-37. ⟨10.1016/j.dam.2017.08.002⟩. ⟨hal-01609009⟩

Collections

INRIA INRIA2
121 View
278 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More