Characterization of graphs and digraphs with small process numbers

Authors:
David Coudert;Jean-Sébastien Sereni
Affiliations:
MASCOTTE, INRIA, I3S, CNRS, Univ. Nice Sophia Antipolis, France;CNRS (LIAFA, Université Denis Diderot), Paris, France and Department of Applied Mathematics (KAM), Charles University, Prague, Czech Republic
Venue:
Discrete Applied Mathematics
Year:
2011

Citing 16
Cited 1

The complexity of searching a graph

Journal of the ACM (JACM)
Introduction to algorithms

Introduction to algorithms
Quickly excluding a forest

Journal of Combinatorial Theory Series B
The vertex separation number of a graph equals its path-width

Information Processing Letters
Graph searching and a min-max theorem for tree-width

Journal of Combinatorial Theory Series B
Obstruction set isolation for the gate matrix layout problem

Discrete Applied Mathematics - Special issue: efficient algorithms and partial k-trees
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

SIAM Journal on Computing
Analysis of rerouting in circuit-switched networks

IEEE/ACM Transactions on Networking (TON)
Wavelength-routed optical networks: linear formulation, resource budgeting tradeoffs, and a reconfiguration study

IEEE/ACM Transactions on Networking (TON)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
On the solution of reroute sequence planning problem in MPLS networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
An annotated bibliography on guaranteed graph searching

Theoretical Computer Science
Reconfiguration of the routing in WDM networks with two classes of services

ONDM'09 Proceedings of the 13th international conference on Optical Network Design and Modeling
A taxonomy of rerouting in circuit-switched networks

IEEE Communications Magazine
Exact and Approximate Solutions for the Gate Matrix Layout Problem

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Optimization of Semi-Dynamic Lightpath Rearrangements in a WDM Network

IEEE Journal on Selected Areas in Communications - Part Supplement

Tradeoffs in process strategy games with application in the WDM reconfiguration problem

Theoretical Computer Science

Quantified Score

Hi-index	0.05

Visualization

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 numbers. 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.