Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:2768390
Jump to:navigation, search

zbMath0984.05041MaRDI QIDQ2768390

Giridhar Pemmasani, Pavel Sumazin, Steven S. Skiena, Michael A. Bender

Publication date: 2 May 2002


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

directed acyclic graphpartially ordered settransitive closureall pairs shortest pathleast common ancestorall pairs longest path


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Partial orders, general (06A06) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)


Related Items (1)

Faster algorithms for finding lowest common ancestors in directed acyclic graphs


Uses Software

  • PHiPAC






This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2768390&oldid=15647366"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 14:31.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki