On fully diverse sets of geometric objects and graphs

DOI10.1007/978-3-031-15914-5_24MaRDI QIDQ6039433zbMATH OpenFDO

Authors Fabian Klute, Marc Van Kreveld

Publication date 5 May 2023

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-15914-5_24

zbMATH Keywords

diversitydistance measuresdiverse embeddingsdiverse geometric objectsdiverse graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites work

• scientific article; zbMATH DE number 2084301 (Why is no real title available?)
• scientific article; zbMATH DE number 2040668 (Why is no real title available?)
• A Remark on Stirling's Formula
• A new lower bound on the maximum number of plane graphs using production matrices
• A survey of graph edit distance
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• Counting Embeddings of Planar Graphs Using DFS Trees
• Determinantal point processes for machine learning
• Diverse partitions of colored points
• Interactive random graph generation with evolutionary algorithms
• On counting planar embeddings
• On-Line Planarity Testing
• Planar graphs, via well-orderly maps and trees
• The number of trees

Cited in

(2)

• Diversities and the Geometry of Hypergraphs
• Computing diverse and nice triangulations

This page was built for publication: On fully diverse sets of geometric objects and graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6039433)