scientific article; zbMATH DE number 1984680
From MaRDI portal
Publication:4428991
zbMath1024.68786MaRDI QIDQ4428991
Publication date: 22 September 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2625/26250036.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99) Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (8)
I/O-Efficient Generation of Massive Graphs Following the LFR Benchmark ⋮ Certifying induced subgraphs in large graphs ⋮ Turing machines with two-level memory: a deep look into the input/output complexity ⋮ Turing machines with two-level memory: new computational models for analyzing the input/output complexity ⋮ Unnamed Item ⋮ On the Weak Prefix-Search Problem ⋮ Analyzing clustering and partitioning problems in selected VLSI models ⋮ The red-blue pebble game on trees and DAGs with large input
This page was built for publication:
