Memory Efficient Anonymous Graph Exploration

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-92248-3_2
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Efficient Parallel Graph Exploration on Multi-Core CPU and GPU

2011English

Memory-Efficient and Thread-Safe Quasi-Destructive Graph Unification

2000English

Efficient Attributes for Anonymous Credentials

2008English

Efficient Anonymous Fingerprinting With Group Signatures

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2000English

Exploration of Memory Hierarchy Configurations for Efficient Garbage Collection on High-Performance Embedded Systems

2009English

A Theory for Control-Flow Graph Exploration

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

An Efficient Graph Indexing Method

2012English

Effective and Efficient Dynamic Graph Coloring

Proceedings of the VLDB Endowment
Computer Science
2017English

Undirected Graph Exploration With ⊝(log Log N) Pebbles

2015English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy