References for Transitive reduction: Computing the reduction in sparse graphs
Back to articleSee all references for article
References to other articles in the 'Computing the reduction in sparse graphs' section
Depth-first search
Linear time
Longest path problem
Sparse graph
--
Go to Article
Using English Wikipedia. Change Language?
--
Size: 830.0 B. 98.25% smaller than original: 46.44 KB 🤮
Fetched: 663 ms. Converted: 380 ms. 🐇
All Wikipedia content is licensed under CC BY-SA 3.0
Response: 20 (Success), text/gemini
| Original URL | gemini://gemi.dev/cgi-bin/wp.cgi/refs?name=Transitive+red... |
|---|---|
| Status Code | 20 (Success) |
| Content-Type | text/gemini; charset=utf-8; lang=en |