Lund University Publications
metadata only
LCA queries in directed acyclic graphs
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
- Formal Design and Parametric Control in Kaija Saariaho’s Circle Map#224539
- Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation#998712
- Edge codes constructed from unicyclic graphs#799611
- Calculation from Strength asymmetry and replacement bias shape the evolution of cooperation in finite populations#238684
- Convergence and acceleration of a nonlinear fixed-point iteration for computing the Fitness Centrality of general graphs#792884
Record · ID 420805
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