UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Fully dynamic all pairs shortest paths with real edge weights

Annual Symposium on Foundations of Computer Science, 2001, p.260-267

2001

Volltextzugriff (PDF)

Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths?

Algorithms – ESA 2006, 2006, p.732-743

2006

Volltextzugriff (PDF)

Finding paths and deleting edges in directed acyclic graphs

Information processing letters, 1988-05, Vol.28 (1), p.5-11

Italiano, Giuseppe F.

1988

Volltextzugriff (PDF)

Amortized efficiency of a path retrieval data structure

Theoretical computer science, 1986, Vol.48 (2-3), p.273-281

Italiano, G.F.

1986

Volltextzugriff (PDF)

A new approach to dynamic all pairs shortest paths

Journal of the ACM, 2004-11, Vol.51 (6), p.968-992

2004

Volltextzugriff (PDF)

Optimal resilient sorting and searching in the presence of memory faults

Theoretical computer science, 2009-10, Vol.410 (44), p.4457-4470

2009

Volltextzugriff (PDF)

Data structures and algorithms for disjoint set union problems

ACM computing surveys, 1991-09, Vol.23 (3), p.319-344

1991

Volltextzugriff (PDF)

On a facility location problem with applications to tele-diagnostic

Optimization letters, 2013-08, Vol.7 (6), p.1179-1192

2013

Volltextzugriff (PDF)

Maintaining dynamic minimum spanning trees: An experimental study

Discrete Applied Mathematics, 2010-03, Vol.158 (5), p.404-425

2010

Volltextzugriff (PDF)

High Capacity Colored Two Dimensional codes

Proceedings of the International Multiconference on Computer Science and Information Technology, 2010, p.709-716

2010

Volltextzugriff (PDF)

Efficient Splitting and Merging Algorithms for Order Decomposable Problems

Information and computation, 1999-10, Vol.154 (1), p.1-33

1999

Volltextzugriff (PDF)

A note on set union with arbitrary deunions

Information processing letters, 1991-03, Vol.37 (6), p.331-335

1991

Volltextzugriff (PDF)

Hypergraph traversal revisited: Cost measures and dynamic algorithms

Lecture notes in computer science, 1998, p.1-16

1998

Volltextzugriff (PDF)

Small stretch (α,β)-spanners in the streaming model

Theoretical computer science, 2009-08, Vol.410 (36), p.3406-3413

2009

Volltextzugriff (PDF)

An algorithm for finding a k-median in a directed tree

Information processing letters, 2000-04, Vol.74 (1-2), p.81-88

2000

Volltextzugriff (PDF)

Efficient splitting and merging algorithms for order decomposable problems

Lecture notes in computer science, 1997, p.605-615

1997

Volltextzugriff (PDF)

Sparsification—a technique for speeding up dynamic graph algorithms

Journal of the ACM, 1997-09, Vol.44 (5), p.669-696

1997

Volltextzugriff (PDF)

Trade-offs for fully dynamic transitive closure on DAGs: Breaking through the O(n2) barrier

Journal of the ACM, 2005-03, Vol.52 (2), p.147-156

2005

Volltextzugriff (PDF)

Incremental algorithms for minimal length paths

Journal of algorithms, 1991-12, Vol.12 (4), p.615-638

1991

Volltextzugriff (PDF)

Fully dynamic algorithms for 2-edge connectivity

SIAM journal on computing, 1992-12, Vol.21 (6), p.1047-1069

1992

Volltextzugriff (PDF)

The set union problem with unlimited backtracking

SIAM journal on computing, 1994-02, Vol.23 (1), p.50-70

1994

Volltextzugriff (PDF)

Designing Reliable Algorithms in Unreliable Memories

Algorithms – ESA 2005, 2005, p.1-8

1ère éd, 2005

Volltextzugriff (PDF)

Small Stretch Spanners on Dynamic Graphs

Algorithms – ESA 2005, 2005, p.532-543

1ère éd, 2005

Volltextzugriff (PDF)

Restoration algorithms for virtual private networks in the hose model

Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, 2002, Vol.1, p.131-139 vol.1

2002

Volltextzugriff (PDF)

Separator Based Sparsification: I. Planarity Testing and Minimum Spanning Trees

Journal of computer and system sciences, 1996, Vol.52 (1), p.3-27

1996

Volltextzugriff (PDF)

1 – 25 von 603

Menü

Weitere Dienste

Einstellungen

Fully dynamic all pairs shortest paths with real edge weights

Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths?

Finding paths and deleting edges in directed acyclic graphs

Amortized efficiency of a path retrieval data structure

A new approach to dynamic all pairs shortest paths

Optimal resilient sorting and searching in the presence of memory faults

Data structures and algorithms for disjoint set union problems

On a facility location problem with applications to tele-diagnostic

Maintaining dynamic minimum spanning trees: An experimental study

High Capacity Colored Two Dimensional codes

Efficient Splitting and Merging Algorithms for Order Decomposable Problems

A note on set union with arbitrary deunions

Hypergraph traversal revisited: Cost measures and dynamic algorithms

Small stretch (α,β)-spanners in the streaming model

An algorithm for finding a k-median in a directed tree

Efficient splitting and merging algorithms for order decomposable problems

Sparsification—a technique for speeding up dynamic graph algorithms

Trade-offs for fully dynamic transitive closure on DAGs: Breaking through the O(n2) barrier

Incremental algorithms for minimal length paths

Fully dynamic algorithms for 2-edge connectivity

The set union problem with unlimited backtracking

Designing Reliable Algorithms in Unreliable Memories

Small Stretch Spanners on Dynamic Graphs

Restoration algorithms for virtual private networks in the hose model

Separator Based Sparsification: I. Planarity Testing and Minimum Spanning Trees

Aktive Filter

Suchergebnisse filtern