On fully diverse sets of geometric objects and graphs

DOI10.1007/978-3-031-15914-5_24MaRDI QIDQ6039433

Marc J. van Kreveld, Fabian Klute

Publication date: 5 May 2023

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

zbMATH Keywords

diversitydistance measuresdiverse embeddingsdiverse geometric objectsdiverse graphs

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• A survey of graph edit distance
• Diverse partitions of colored points
• On counting planar embeddings
• A new lower bound on the maximum number of plane graphs using production matrices
• Planar graphs, via well-orderly maps and trees
• The number of trees
• Determinantal Point Processes for Machine Learning
• Counting Embeddings of Planar Graphs Using DFS Trees
• A Remark on Stirling's Formula
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• On-Line Planarity Testing
• Interactive Random Graph Generation with Evolutionary Algorithms

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