Partially Complemented Representations of Digraphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1999

Partially Complemented Representations of Digraphs

Elias Dahlhaus
  • Function : Author
Ross M. Mcconnell
  • Function : Author


A complementation operation on a vertex of a digraph changes all outgoing arcs into non-arcs, and outgoing non-arcs into arcs. This defines an equivalen- ce relation where two digraphs are equivalent if one can be obtained from the other by a sequence of such operations. We show that given an adjacency-li- st representation of a digraph G, many fundamental graph algorithms can be carried out on any member G' of G's equivalence class in O(n+m) time, where m is the number of arcs in G, not the number of arcs in G' . This may have advantages when G' is much larger than G. We use this to generalize to digraphs a simple O(n + m \log n) algorithm of McConnell and Spinrad for finding the modular decomposition of undirected graphs. A key step is finding the strongly-connected components of a digraph F in G's equivalence class, where F may have \omega(m \log n) arcs.
Fichier principal
Vignette du fichier
RR-3832.pdf (355.67 Ko) Télécharger le fichier

Dates and versions

inria-00072825 , version 1 (24-05-2006)


  • HAL Id : inria-00072825 , version 1


Elias Dahlhaus, Jens Gustedt, Ross M. Mcconnell. Partially Complemented Representations of Digraphs. [Research Report] RR-3832, INRIA. 1999, pp.24. ⟨inria-00072825⟩
74 View
114 Download


Gmail Facebook Twitter LinkedIn More