SMOLNET PORTAL home about changes

References for Transitive reduction: Computing the reduction in sparse graphs

Back to article
See all references for article


References to other articles in the 'Computing the reduction in sparse graphs' section

Breadth first search
Depth-first search
Linear time
Longest path problem
Sparse graph


Source on Wikipedia (https://en.wikipedia.org)


--

Gemipedia Home
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. 🐇

Made with 📚 and ❤️ by Acidus (mailto://)

All Wikipedia content is licensed under CC BY-SA 3.0

Response: 20 (Success), text/gemini
Original URLgemini://gemi.dev/cgi-bin/wp.cgi/refs?name=Transitive+red...
Status Code20 (Success)
Content-Typetext/gemini; charset=utf-8; lang=en