AAAAAA

   
Results: 1-7 |
Results: 7
SEPARATOR-BASED SPARSIFICATION - II - EDGE AND VERTEX CONNECTIVITY
Authors: EPPSTEIN D GALIL Z ITALIANO GF SPENCER TH
Citation: D. Eppstein et al., SEPARATOR-BASED SPARSIFICATION - II - EDGE AND VERTEX CONNECTIVITY, SIAM journal on computing (Print), 28(1), 1999, pp. 341-381
MAINTAINING SPANNING-TREES OF SMALL-DIAMETER
Authors: ITALIANO GF RAMASWAMI R
Citation: Gf. Italiano et R. Ramaswami, MAINTAINING SPANNING-TREES OF SMALL-DIAMETER, Algorithmica, 22(3), 1998, pp. 275-304
SPARSIFICATION - A TECHNIQUE FOR SPEEDING-UP DYNAMIC GRAPH ALGORITHMS
Authors: EPPSTEIN D GALIL Z ITALIANO GF NISSENZWEIG A
Citation: D. Eppstein et al., SPARSIFICATION - A TECHNIQUE FOR SPEEDING-UP DYNAMIC GRAPH ALGORITHMS, JOURNAL OF THE ACM, 44(5), 1997, pp. 669-696
DECREMENTAL 2-CONNECTIVITY AND 3-CONNECTIVITY ON PLANAR GRAPHS
Authors: GIAMMARRESI D ITALIANO GF
Citation: D. Giammarresi et Gf. Italiano, DECREMENTAL 2-CONNECTIVITY AND 3-CONNECTIVITY ON PLANAR GRAPHS, Algorithmica, 16(3), 1996, pp. 263-287
SEPARATOR BASED SPARSIFICATION .1. PLANARITY TESTING AND MINIMUM SPANNING-TREES
Authors: EPPSTEIN D GALIL Z ITALIANO GF SPENCER TH
Citation: D. Eppstein et al., SEPARATOR BASED SPARSIFICATION .1. PLANARITY TESTING AND MINIMUM SPANNING-TREES, Journal of computer and system sciences, 52(1), 1996, pp. 3-27
SPECIAL ISSUE ON DYNAMIC AND ONLINE ALGORITHMS - FOREWORD
Authors: AUSIELLO G ITALIANO GF
Citation: G. Ausiello et Gf. Italiano, SPECIAL ISSUE ON DYNAMIC AND ONLINE ALGORITHMS - FOREWORD, Theoretical computer science, 130(1), 1994, pp. 1-4
THE SET UNION PROBLEM WITH UNLIMITED BACKTRACKING
Authors: APOSTOLICO A ITALIANO GF GAMBOSI G TALAMO M
Citation: A. Apostolico et al., THE SET UNION PROBLEM WITH UNLIMITED BACKTRACKING, SIAM journal on computing, 23(1), 1994, pp. 50-70
Risultati: 1-7 |