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

Algorithms For Longest Chains In Pseudo- Transitive Graphs

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

zbMath1312.05065arXiv1701.05286MaRDI QIDQ5252023

Farhad Shahrokhi

Publication date: 21 May 2015

Full work available at URL: https://arxiv.org/abs/1701.05286


zbMATH Keywords

orderingpseudo-transitivity


Mathematics Subject Classification ID

Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)







This page was built for publication: Algorithms For Longest Chains In Pseudo- Transitive Graphs

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