Pascal and Francis Bibliographic Databases

Help

Export

Selection :

Permanent link
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=20082948

ALGORITHMS FOR FAULT-TOLERANT ROUTING IN CIRCUIT-SWITCHED NETWORKS

Author
BAGCHI, Amitabha1 ; CHAUDHARY, Amitabh2 ; SCHEIDELER, Christian3 ; KOLMAN, Petr4
[1] Department, of Computer Science and Engineering, Indian Institute of Technology Delhi, India
[2] Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN 46556, United States
[3] Department of Informatics, Technische Universität München, Germany
[4] Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic
Source

SIAM journal on discrete mathematics (Print). 2008, Vol 21, Num 1, pp 141-157, 17 p ; ref : 22 ref

CODEN
SJDMEC
ISSN
0895-4801
Scientific domain
Control theory, operational research; Computer science; Mathematics
Publisher
Society for Industrial and Applied Mathematics, Philadelphia, PA
Publication country
United States
Document type
Article
Language
English
Author keyword
68R10 edge-disjoint paths fault-tolerant routing flow number greedy algorithms multicommodity flow; 68W40
Keyword (fr)
Addition Algorithme déterministe Algorithme en ligne Algorithme glouton Application Arête graphe Circuit commutation Commutation Connaissance Contrainte Expansion Flot Mathématiques discrètes Maximum Performance Routage Réseau fibre optique 68R10 68Wxx Algorithm en ligne Problème chemin
Keyword (en)
Addition Deterministic algorithms Online algorithm Greedy algorithm Application Edge(graph) Switching circuit Switching Knowledge Constraint Expansion Flow Discrete mathematics Maximum Performance Routing Optical fiber network
Keyword (es)
Adicción Algoritmo en línea Algoritmo glotón Aplicación Arista gráfico Circuito conmutación Conmutación Conocimiento Coacción Expansión Oleada Matemáticas discretas Máximo Rendimiento Enrutamiento Red fibra óptica
Classification
Pascal
001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02B Combinatorics. Ordered structures / 001A02B01 Combinatorics

Pascal
001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02C Algebra

Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A05 Algorithmics. Computability. Computer arithmetics

Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A06 Information retrieval. Graph

Discipline
Computer science : theoretical automation and systems Mathematics
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
20082948

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Access to the document

Searching the Web