Characterization of graphs and digraphs with small process number - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Applied Mathematics Year : 2011

Characterization of graphs and digraphs with small process number

Abstract

We introduce the process number of a digraph as a tool to study rerouting issues in \wdm networks. This parameter is closely related to the vertex separation (or pathwidth). We consider the recognition and the characterization of (di)graphs with small process number. In particular, we give a linear time algorithm to recognize (and process) graphs with process number at most 2, along with a characterization in terms of forbidden minors, and a structural description. As for digraphs with process number 2, we exhibit a characterization that allows one to recognize (and process) them in polynomial time.
Fichier principal
Vignette du fichier
dam-noformat.pdf (392.53 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00587717 , version 1 (21-04-2011)

Identifiers

Cite

David Coudert, Jean-Sébastien Sereni. Characterization of graphs and digraphs with small process number. Discrete Applied Mathematics, 2011, 159 (11), pp.1094-1109. ⟨10.1016/j.dam.2011.03.010⟩. ⟨inria-00587717⟩
199 View
205 Download

Altmetric

Share

Gmail Facebook X LinkedIn More