Using Design Patterns for Reusable, Efficient Implementations of Graph Algorithms
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
Using Design Patterns for Reusable, Efficient Implementations of Graph Algorithms ; 1
Konstanzer Schriften in Mathematik und Informatik ; 1
- Classification
-
Informatik
- Creator
-
Kühl, Dietmar
Weihe, Karsten
- URN
-
urn:nbn:de:bsz:352-opus-19936
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
- 14.08.2025, 11:04 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Kühl, Dietmar
- Weihe, Karsten
Other Objects (12)
Designing Functional Implementations of Graph Algorithms
Combining LEDA with Customizable Implementations of Graph Algorithms
On Hard Subgraph Problems: Parameterized Algorithms and Efficient Implementations
Space-efficient Basic Graph Algorithms
Efficient Graph Algorithms in Neo4j
Robotic exploration and landmark determination : hardware efficient algorithms and FPGA implementations
Efficient parameterized algorithms on structured graphs
Computer arithmetic : algorithms and hardware implementations
Efficient parallel implementations of eigenproblems reduction
Space efficient algorithms for graph isomorphism and representation
Scalable Graph Algorithms using Practically Efficient Data Reductions
Communication in parallel systems : models, algorithms and implementations
Designing Functional Implementations of Graph Algorithms
Combining LEDA with Customizable Implementations of Graph Algorithms
On Hard Subgraph Problems: Parameterized Algorithms and Efficient Implementations
Space-efficient Basic Graph Algorithms
Efficient Graph Algorithms in Neo4j
Robotic exploration and landmark determination : hardware efficient algorithms and FPGA implementations
Efficient parameterized algorithms on structured graphs
Computer arithmetic : algorithms and hardware implementations
Efficient parallel implementations of eigenproblems reduction
Space efficient algorithms for graph isomorphism and representation
Scalable Graph Algorithms using Practically Efficient Data Reductions
Communication in parallel systems : models, algorithms and implementations
Designing Functional Implementations of Graph Algorithms
Combining LEDA with Customizable Implementations of Graph Algorithms
On Hard Subgraph Problems: Parameterized Algorithms and Efficient Implementations
Space-efficient Basic Graph Algorithms
Efficient Graph Algorithms in Neo4j
Robotic exploration and landmark determination : hardware efficient algorithms and FPGA implementations
Efficient parameterized algorithms on structured graphs
Computer arithmetic : algorithms and hardware implementations
Efficient parallel implementations of eigenproblems reduction
Space efficient algorithms for graph isomorphism and representation
Scalable Graph Algorithms using Practically Efficient Data Reductions