Treffer: Characterization of graphs and digraphs with small process number

Title:
Characterization of graphs and digraphs with small process number
Authors:
Coudert, David, Sereni, Jean-Sébastien
Contributors:
Algorithms, simulation, combinatorics and optimization for telecommunications (MASCOTTE), Centre Inria d'Université Côte d'Azur, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UniCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UniCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UniCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UniCA), Institute for Theoretical Computer Science (ITI), Univerzita Karlova [Praha, Česká republika] = Charles University [Prague, Czech Republic] (UK), IST FET AEOLUS, COST 293 GRAAL, INRIA, ANR-05-JCJC-0141,OSERA,Optimisation et Simulation pour l&aposEtude des Réseaux Ambiants(2005)
Source:
[Research Report] RR-6285. :26-26
Publisher Information:
CCSD, 2008.
Publication Year:
2008
Collection:
collection:UNICE
collection:CNRS
collection:INRIA
collection:INRIA-SOPHIA
collection:INRIA-RRRT
collection:I3S
collection:INRIASO
collection:INRIA_TEST
collection:TESTALAIN1
collection:INRIA2
collection:TDS-MACS
collection:LARA
collection:UNIV-COTEDAZUR
collection:ANR
collection:TEST-NICE
Subject Terms:
Rerouting, process number, vertex separation, pathwidth, ACM: G.: Mathematics of Computing, G.2: DISCRETE MATHEMATICS, G.2.2: Graph Theory, G.2.2.0: Graph algorithms, G.2.2.3: Network problems, [INFO.INFO-DM]Computer Science [cs], Discrete Mathematics [cs.DM], [INFO.INFO-NI]Computer Science [cs], Networking and Internet Architecture [cs.NI]
Original Identifier:
HAL:
Document Type:
Report report<br />Reports
Language:
English
Access URL:
https://inria.hal.science/inria-00171083
https://inria.hal.science/inria-00171083v4/document
https://inria.hal.science/inria-00171083v4/file/RR-6285-v2.pdf
Rights:
info:eu-repo/semantics/OpenAccess
Accession Number:
edshal.inria.00171083v4
Database:
HAL

Weitere Informationen

The process number of a digraph has been introduced as a tool to study rerouting issues in WDM networks. We consider the recognition and the characterization of (di)graphs with process number at most two.