Treffer: An exact sublinear algorithm for the max-flow, vertex disjoint paths and communication problems on random graphs
Title:
An exact sublinear algorithm for the max-flow, vertex disjoint paths and communication problems on random graphs
Authors:
Source:
Operations research. 40(5):923-935
Publisher Information:
Linthicum, MD: Institute for Operations Research and the Management Sciences, 1992.
Publication Year:
1992
Physical Description:
print, 16 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Recherche operationnelle. Gestion, Operational research. Management science, Recherche opérationnelle et modèles formalisés de gestion, Operational research and scientific management, Flots dans les réseaux. Problèmes combinatoires, Flows in networks. Combinatorial problems, Algorithme parallèle, Parallel algorithm, Algoritmo paralelo, Analyse algorithme, Algorithm analysis, Análisis algoritmo, Chemin graphe, Graph path, Camino grafo, Communication, Comunicación, Complexité calcul, Computing complexity, Complejidad cálculo, Couplage graphe, Graph matching, Acoplamiento grafo, Flot optimal, Optimal flow, Flujo óptimo, Graphe aléatoire, Random graph, Grafo aleatorio, Graphe connexe, Connected graph, Grafo connexo, Implémentation, Implementation, Ejecución, Méthode empirique, Empirical method, Método empírico, Méthode séquentielle, Sequential method, Método secuencial, Réseau, Network, Red, Théorie graphe, Graph theory, Teoría grafo
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
Univ. California, Berkeley CA, United States
ISSN:
0030-364X
Rights:
Copyright 1993 INIST-CNRS
CC BY 4.0
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
CC BY 4.0
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
Notes:
Operational research. Management
Accession Number:
edscal.4518646
Database:
PASCAL Archive