Counting edges in a dag
From MaRDI portal
Publication:6550536
DOI10.1007/3-540-62559-3_9zbMATH Open1539.68215MaRDI QIDQ6550536
F. Pugliese, Umberto Nanni, Serafino Cicerone, Daniele Frigioni
Publication date: 5 June 2024
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Amortized efficiency of a path retrieval data structure
- Computing dominators in parallel
- Algorithms of placing recovery points
- Finding paths and deleting edges in directed acyclic graphs
- Fast Algorithms for Finding Nearest Common Ancestors
- A fast algorithm for finding dominators in a flowgraph
- Incremental algorithms for minimal length paths
- Optimal algorithm for the nearest common dominator problem
- Finding Dominators in Directed Graphs
- Faster shortest-path algorithms for planar graphs
This page was built for publication: Counting edges in a dag
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550536)
