Deutsche Nationalbibliothek
metadata only
Verification of Graph Algorithms in the Context of Wireless Networks / Lucas Böltz ; Gutachter: Viorica Sofronie-Stokkermans, Hannes Frey
Dissertation, Koblenz, Universität Koblenz, 2026
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- AutoGraphForge: Towards Automated Graph Theory Discovery#926397
- HNSW with Accuracy Guarantees Using Graph Spanners -- A Technical Report#332529
- Tight Energy Lower Bounds for Distributed Graph Algorithms#467099
- Introduction to Algorithms#67006
- A $O^*((2 + ε)^k)$ Time Algorithm for Cograph Deletion Using Unavoidable Subgraphs in Large Prime Graphs#1115504
Record · ID 1119806
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive