Lund University Publications
metadata only
A path cover technique for LCAs in dags
As a second major result we show how to combine the path cover technique with LCA solutions for dags with small depth [9]. Our algorithm attains the best known upper time bound for this problem of O(n 2.575). However, most notably, the algorithm performs better on a vast amount of input dags, i.e. d
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
- MLegS: A modern mapped Legendre spectral method solver for unbounded domains with parallelization#1011733
- Multimmit: Extending Blocks for Faster Finality#394371
- Algorithmic Boundary Conservation#477949
- Long-step strategies in interior-point primal-dual methods#429967
- Low-Order Refined Preconditioning for Spectral/hp Element Method for Complex, 3D Geometries#1106142
Record · ID 823217
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