Dynamic detection of subgraphs in computer networks (Englisch)
Nationallizenz
- Neue Suche nach: Cidon, Israel
- Neue Suche nach: Gopal, Inder S.
- Neue Suche nach: Cidon, Israel
- Neue Suche nach: Gopal, Inder S.
In:
Algorithmica
;
5
, 1
;
277-294
;
1990
- Aufsatz (Zeitschrift) / Elektronische Ressource
-
Titel:Dynamic detection of subgraphs in computer networks
-
Beteiligte:Cidon, Israel ( Autor:in ) / Gopal, Inder S. ( Autor:in )
-
Erschienen in:Algorithmica ; 5, 1 ; 277-294
-
Verlag:
- Neue Suche nach: Springer-Verlag
-
Erscheinungsort:New York
-
Erscheinungsdatum:01.06.1990
-
Format / Umfang:18 pages
-
ISSN:
-
DOI:
-
Medientyp:Aufsatz (Zeitschrift)
-
Format:Elektronische Ressource
-
Sprache:Englisch
-
Schlagwörter:
-
Datenquelle:
Inhaltsverzeichnis – Band 5, Ausgabe 1
Zeige alle Jahrgänge und Ausgaben
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
An improved parallel algorithm for integer GCDChor, Benny / Goldreich, Oded et al. | 1990
- 11
-
Approximation algorithms for partitioning a rectangle with interior pointsGonzalez, Teofilo / Professor Zheng, Si-Qing et al. | 1990
- 43
-
Efficient parallel algorithms for graph problemsKruskal, Clyde P. / Rudolph, Larry / Snir, Marc et al. | 1990
- 65
-
A new algorithm for the largest empty rectangle problemOrlowski, M. et al. | 1990
- 75
-
Improved sorting networks withO(logN) depthPaterson, M. S. et al. | 1990
- 93
-
On the complexity of embedding planar graphs to minimize certain distance measuresBienstock, Daniel / Monma, Clyde L. et al. | 1990
- 111
-
On heuristics for minimum length rectilinear partitionsDu, Dingzhu / Zhang, Yanjun et al. | 1990
- 129
-
Efficient parallel algorithms forr-dominating set andp-center problems on treesHe, Xin / Yesha, Yaacov et al. | 1990
- 147
-
An algorithm for constructing gröbner bases from characteristic sets and its application to geometryChou, Shang-Ching / Schelter, William F. / Yang, Jin-Gen et al. | 1990
- 155
-
Parallel geometric algorithms on a mesh-connected computerJeong, C. S. / Lee, D. T. et al. | 1990
- 179
-
Solving some combinatorial problems on arrays with one-way dataflowSavage, Carla D. / Stallmann, Matthias / Perry, Jo Ellen et al. | 1990
- 201
-
A fast algorithm for computing sparse visibility graphsSudarshan, S. / Pandu Rangan, C. et al. | 1990
- 215
-
Dynamic fractional cascadingMehlhorn, Kurt / Näher, Stefan et al. | 1990
- 243
-
An optimal time bound for oblivious routingParberry, Ian et al. | 1990
- 251
-
Internal and external algorithms for the points-in-regions problem—the inside join of geo-relational algebraBlankenagel, Gabriele / Güting, Ralf Hartmut et al. | 1990
- 277
-
Dynamic detection of subgraphs in computer networksCidon, Israel / Gopal, Inder S. et al. | 1990
- 295
-
Analysis of the standard deletion algorithms in exact fit domain binary search treesCulberson, Joseph / Munro, J. Ian et al. | 1990
- 313
-
A linear-time algorithm for finding approximate shortest common superstringsUkkonen, Esko et al. | 1990
- 325
-
Asynchronous distributed termination—parallel and symmetric solutions with echo algorithmsMattern, Friedemann et al. | 1990
- 341
-
An optimal approximation algorithm for the rectilinearm-center problemKo, M. T. / Lee, R. C. T. / Chang, J. S. et al. | 1990
- 353
-
The complexity of planar compliant motion planning under uncertaintyDonald, Bruce R. et al. | 1990
- 383
-
An efficient distributed algorithm for maximum matching in general graphsWu, Michael M. / Loui, Michael C. et al. | 1990
- 407
-
Computing euclidean maximum spanning treesMonma, Clyde / Paterson, Michael / Suri, Subhash / Yao, Frances et al. | 1990
- 421
-
Computational geometry in a curved worldDobkin, David P. / Souvaine, Diane L. et al. | 1990
- 459
-
A better performance guarantee for approximate graph coloringBerger, Bonnie / Rompel, John et al. | 1990
- 467
-
A theory of rectangular dual graphsLai, Yen-Tai / Leinwand, Sany M. et al. | 1990
- 485
-
Some chain visibility problems in a simple polygonLee, Sang-Ho / Chwa, Kyung-Yong et al. | 1990
- 509
-
Dynamic maintenance of planar digraphs, with applicationsTamassia, Roberto / Preparata, Franco P. et al. | 1990
- 529
-
A new scheme for the deterministic simulation of PRAMs in VLSILuccio, F. / Pietracaprina, A. / Pucci, G. et al. | 1990
- 545
-
Efficient parallel and sequential algorithms for 4-coloring perfect planar graphsHe, Xin et al. | 1990
- 561
-
Searching for empty convex polygonsDobkin, David P. / Edelsbrunner, Herbert / Overmars, Mark H. et al. | 1990
- 573
-
An optimal algorithm for the boundary of a cell in a union of raysAlevizos, Panagiotis / Boissonnat, Jean-Daniel / Preparata, Franco P. et al. | 1990
- 591
-
Comments on Bern's probabilistic results on rectilinear Steiner treesHwang, F. K. / Yao, Y. C. et al. | 1990