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

Efficient enumeration of non-isomorphic Ptolemaic graphs

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

DOI10.1007/978-3-030-39881-1_25OpenAlexW3003790514MaRDI QIDQ782198

Ryuhei Uehara, Dat Hoang Tran

Publication date: 22 July 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-39881-1_25



Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)


Related Items (2)

Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs ⋮ Efficient enumeration of non-isomorphic distance-hereditary graphs and Ptolemaic graphs






This page was built for publication: Efficient enumeration of non-isomorphic Ptolemaic graphs

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