scientific article; zbMATH DE number 1984682

MaRDI QIDQ4428993zbMATH OpenFDO

Authors Laura Toma, Norbert Zeh

Publication date 22 September 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2625/26250085.htm

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99)

Cited in

(3)

• An I/O-Efficient Algorithm for Computing Vertex Separators on Multi-Dimensional Grid Graphs and Its Applications
• I/O-efficient algorithms for graphs of bounded treewidth
• Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4428993)