Abstract
Mathematical explorations steer us through fields and forests of applications where science and computing meet discrete structures and combinatorics. Today’s excursion takes us on one of the speaker’s favorite journeys in the world of algorithmic graph theory – containment orders, treelike orders and their comparability graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: AKCE International Journal of Graphs and Combinatorics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
